H-Termination proof of /home/matraf/haskell/eval_FullyBlown

MAYBE 104.169 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could not be shown:

↳ HASKELL

  ↳ BR

mainModule Main

((enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering]) :: Ordering -> Ordering -> Ordering -> [Ordering])

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

mainModule Main

((enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering]) :: Ordering -> Ordering -> Ordering -> [Ordering])

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

The following Function with conditions

p

| n' >= n

= flip (<=) m

| otherwise

= flip (>=) m

is transformed to

p = p2

p1 True = flip (<=) m

p1 False = p0 otherwise

p0 True = flip (>=) m

p2 = p1 (n' >= n)

The following Function with conditions

takeWhile p [] = []

takeWhile p (x : xs)

| p x

= x : takeWhile p xs

| otherwise

= []

is transformed to

takeWhile p [] = takeWhile3 p []

takeWhile p (x : xs) = takeWhile2 p (x : xs)

takeWhile1 p x xs True = x : takeWhile p xs

takeWhile1 p x xs False = takeWhile0 p x xs otherwise

takeWhile0 p x xs True = []

takeWhile2 p (x : xs) = takeWhile1 p x xs (p x)

takeWhile3 p [] = []

takeWhile3 wv ww = takeWhile2 wv ww

The following Function with conditions

toEnum 0 = LT

toEnum 1 = EQ

toEnum 2 = GT

is transformed to

toEnum xw = toEnum5 xw

toEnum wy = toEnum3 wy

toEnum wx = toEnum1 wx

toEnum0 True wx = GT

toEnum1 wx = toEnum0 (wx == 2) wx

toEnum2 True wy = EQ

toEnum2 wz xu = toEnum1 xu

toEnum3 wy = toEnum2 (wy == 1) wy

toEnum3 xv = toEnum1 xv

toEnum4 True xw = LT

toEnum4 xx xy = toEnum3 xy

toEnum5 xw = toEnum4 (xw == 0) xw

toEnum5 xz = toEnum3 xz

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

mainModule Main

((enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering]) :: Ordering -> Ordering -> Ordering -> [Ordering])

module Main where

import qualified Prelude

Let/Where Reductions:
The bindings of the following Let/Where expression

takeWhile p (numericEnumFromThen n n')

where

p = p2

p0 True = flip (>=) m

p1 True = flip (<=) m

p1 False = p0 otherwise

p2 = p1 (n' >= n)

are unpacked to the following functions on top level

numericEnumFromThenToP2 yu yv yw = numericEnumFromThenToP1 yu yv yw (yu >= yv)

numericEnumFromThenToP1 yu yv yw True = flip (<=) yw

numericEnumFromThenToP1 yu yv yw False = numericEnumFromThenToP0 yu yv yw otherwise

numericEnumFromThenToP yu yv yw = numericEnumFromThenToP2 yu yv yw

numericEnumFromThenToP0 yu yv yw True = flip (>=) yw

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

mainModule Main

((enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering]) :: Ordering -> Ordering -> Ordering -> [Ordering])

module Main where

import qualified Prelude

Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                  ↳ Narrow

mainModule Main

(enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering])

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="enumFromThenTo",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="enumFromThenTo yx3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="enumFromThenTo yx3 yx4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3];
5[label="enumFromThenTo yx3 yx4 yx5",fontsize=16,color="black",shape="triangle"];5 -> 6[label="",style="solid", color="black", weight=3];
6 -> 800[label="",style="dashed", color="red", weight=0];
6[label="map toEnum (enumFromThenTo (fromEnum yx3) (fromEnum yx4) (fromEnum yx5))",fontsize=16,color="magenta"];6 -> 801[label="",style="dashed", color="magenta", weight=3];
801[label="enumFromThenTo (fromEnum yx3) (fromEnum yx4) (fromEnum yx5)",fontsize=16,color="black",shape="box"];801 -> 1415[label="",style="solid", color="black", weight=3];
800[label="map toEnum yx13\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];2647[label="yx13/yx130 : yx131",fontsize=10,color="white",style="solid",shape="box"];800 -> 2647[label="",style="solid", color="burlywood", weight=9];
2647 -> 1416[label="",style="solid", color="burlywood", weight=3];
2648[label="yx13/[]",fontsize=10,color="white",style="solid",shape="box"];800 -> 2648[label="",style="solid", color="burlywood", weight=9];
2648 -> 1417[label="",style="solid", color="burlywood", weight=3];
1415[label="numericEnumFromThenTo (fromEnum yx3) (fromEnum yx4) (fromEnum yx5)",fontsize=16,color="black",shape="box"];1415 -> 1418[label="",style="solid", color="black", weight=3];
1416[label="map toEnum (yx130 : yx131)\n  Enum a",fontsize=16,color="black",shape="box"];1416 -> 1419[label="",style="solid", color="black", weight=3];
1417[label="map toEnum []\n  Enum a",fontsize=16,color="black",shape="box"];1417 -> 1420[label="",style="solid", color="black", weight=3];
1418[label="takeWhile (numericEnumFromThenToP (fromEnum yx4) (fromEnum yx3) (fromEnum yx5)) (numericEnumFromThen (fromEnum yx3) (fromEnum yx4))",fontsize=16,color="black",shape="box"];1418 -> 1421[label="",style="solid", color="black", weight=3];
1419[label="toEnum yx130 : map toEnum yx131\n  Enum a",fontsize=16,color="green",shape="box"];1419 -> 1422[label="",style="dashed", color="green", weight=3];
1419 -> 1423[label="",style="dashed", color="green", weight=3];
1420[label="[]\n  Enum a",fontsize=16,color="green",shape="box"];1421[label="takeWhile (numericEnumFromThenToP (fromEnum yx4) (fromEnum yx3) (fromEnum yx5)) (iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1421 -> 1424[label="",style="solid", color="black", weight=3];
1422[label="toEnum yx130\n  Enum a",fontsize=16,color="blue",shape="box"];2649[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2649[label="",style="solid", color="blue", weight=9];
2649 -> 1425[label="",style="solid", color="blue", weight=3];
2650[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2650[label="",style="solid", color="blue", weight=9];
2650 -> 1426[label="",style="solid", color="blue", weight=3];
2651[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2651[label="",style="solid", color="blue", weight=9];
2651 -> 1427[label="",style="solid", color="blue", weight=3];
2652[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2652[label="",style="solid", color="blue", weight=9];
2652 -> 1428[label="",style="solid", color="blue", weight=3];
2653[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2653[label="",style="solid", color="blue", weight=9];
2653 -> 1429[label="",style="solid", color="blue", weight=3];
2654[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2654[label="",style="solid", color="blue", weight=9];
2654 -> 1430[label="",style="solid", color="blue", weight=3];
2655[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2655[label="",style="solid", color="blue", weight=9];
2655 -> 1431[label="",style="solid", color="blue", weight=3];
2656[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2656[label="",style="solid", color="blue", weight=9];
2656 -> 1432[label="",style="solid", color="blue", weight=3];
2657[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];1422 -> 2657[label="",style="solid", color="blue", weight=9];
2657 -> 1433[label="",style="solid", color="blue", weight=3];
1423 -> 800[label="",style="dashed", color="red", weight=0];
1423[label="map toEnum yx131\n  Enum a",fontsize=16,color="magenta"];1423 -> 1434[label="",style="dashed", color="magenta", weight=3];
1424[label="takeWhile (numericEnumFromThenToP (fromEnum yx4) (fromEnum yx3) (fromEnum yx5)) (fromEnum yx3 : iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx4 - fromEnum yx3 + fromEnum yx3))",fontsize=16,color="black",shape="box"];1424 -> 1435[label="",style="solid", color="black", weight=3];
1425[label="toEnum yx130\n  Integral a",fontsize=16,color="black",shape="box"];1425 -> 1436[label="",style="solid", color="black", weight=3];
1426[label="toEnum yx130",fontsize=16,color="black",shape="box"];1426 -> 1437[label="",style="solid", color="black", weight=3];
1427[label="toEnum yx130",fontsize=16,color="black",shape="box"];1427 -> 1438[label="",style="solid", color="black", weight=3];
1428[label="toEnum yx130",fontsize=16,color="black",shape="box"];1428 -> 1439[label="",style="solid", color="black", weight=3];
1429[label="toEnum yx130",fontsize=16,color="black",shape="box"];1429 -> 1440[label="",style="solid", color="black", weight=3];
1430[label="toEnum yx130",fontsize=16,color="black",shape="box"];1430 -> 1441[label="",style="solid", color="black", weight=3];
1431[label="toEnum yx130",fontsize=16,color="black",shape="box"];1431 -> 1442[label="",style="solid", color="black", weight=3];
1432[label="toEnum yx130",fontsize=16,color="black",shape="box"];1432 -> 1443[label="",style="solid", color="black", weight=3];
1433[label="toEnum yx130",fontsize=16,color="black",shape="box"];1433 -> 1444[label="",style="solid", color="black", weight=3];
1434[label="yx131",fontsize=16,color="green",shape="box"];1435[label="takeWhile2 (numericEnumFromThenToP (fromEnum yx4) (fromEnum yx3) (fromEnum yx5)) (fromEnum yx3 : iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx4 - fromEnum yx3 + fromEnum yx3))",fontsize=16,color="black",shape="box"];1435 -> 1445[label="",style="solid", color="black", weight=3];
1436[label="error []",fontsize=16,color="red",shape="box"];1437[label="error []",fontsize=16,color="red",shape="box"];1438[label="error []",fontsize=16,color="red",shape="box"];1439[label="error []",fontsize=16,color="red",shape="box"];1440[label="error []",fontsize=16,color="red",shape="box"];1441[label="error []",fontsize=16,color="red",shape="box"];1442[label="error []",fontsize=16,color="red",shape="box"];1443[label="error []",fontsize=16,color="red",shape="box"];1444[label="toEnum5 yx130",fontsize=16,color="black",shape="box"];1444 -> 1446[label="",style="solid", color="black", weight=3];
1445[label="takeWhile1 (numericEnumFromThenToP (fromEnum yx4) (fromEnum yx3) (fromEnum yx5)) (fromEnum yx3) (iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx4 - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1445 -> 1447[label="",style="solid", color="black", weight=3];
1446[label="toEnum4 (yx130 == Pos Zero) yx130",fontsize=16,color="black",shape="box"];1446 -> 1448[label="",style="solid", color="black", weight=3];
1447[label="takeWhile1 (numericEnumFromThenToP2 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5)) (fromEnum yx3) (iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx4 - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP2 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1447 -> 1449[label="",style="solid", color="black", weight=3];
1448[label="toEnum4 (primEqInt yx130 (Pos Zero)) yx130",fontsize=16,color="burlywood",shape="box"];2659[label="yx130/Pos yx1300",fontsize=10,color="white",style="solid",shape="box"];1448 -> 2659[label="",style="solid", color="burlywood", weight=9];
2659 -> 1450[label="",style="solid", color="burlywood", weight=3];
2660[label="yx130/Neg yx1300",fontsize=10,color="white",style="solid",shape="box"];1448 -> 2660[label="",style="solid", color="burlywood", weight=9];
2660 -> 1451[label="",style="solid", color="burlywood", weight=3];
1449[label="takeWhile1 (numericEnumFromThenToP1 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (fromEnum yx4 >= fromEnum yx3)) (fromEnum yx3) (iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx4 - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (fromEnum yx4 >= fromEnum yx3) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1449 -> 1452[label="",style="solid", color="black", weight=3];
1450[label="toEnum4 (primEqInt (Pos yx1300) (Pos Zero)) (Pos yx1300)",fontsize=16,color="burlywood",shape="box"];2661[label="yx1300/Succ yx13000",fontsize=10,color="white",style="solid",shape="box"];1450 -> 2661[label="",style="solid", color="burlywood", weight=9];
2661 -> 1453[label="",style="solid", color="burlywood", weight=3];
2662[label="yx1300/Zero",fontsize=10,color="white",style="solid",shape="box"];1450 -> 2662[label="",style="solid", color="burlywood", weight=9];
2662 -> 1454[label="",style="solid", color="burlywood", weight=3];
1451[label="toEnum4 (primEqInt (Neg yx1300) (Pos Zero)) (Neg yx1300)",fontsize=16,color="burlywood",shape="box"];2663[label="yx1300/Succ yx13000",fontsize=10,color="white",style="solid",shape="box"];1451 -> 2663[label="",style="solid", color="burlywood", weight=9];
2663 -> 1455[label="",style="solid", color="burlywood", weight=3];
2664[label="yx1300/Zero",fontsize=10,color="white",style="solid",shape="box"];1451 -> 2664[label="",style="solid", color="burlywood", weight=9];
2664 -> 1456[label="",style="solid", color="burlywood", weight=3];
1452[label="takeWhile1 (numericEnumFromThenToP1 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (compare (fromEnum yx4) (fromEnum yx3) /= LT)) (fromEnum yx3) (iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx4 - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (compare (fromEnum yx4) (fromEnum yx3) /= LT) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1452 -> 1457[label="",style="solid", color="black", weight=3];
1453[label="toEnum4 (primEqInt (Pos (Succ yx13000)) (Pos Zero)) (Pos (Succ yx13000))",fontsize=16,color="black",shape="box"];1453 -> 1458[label="",style="solid", color="black", weight=3];
1454[label="toEnum4 (primEqInt (Pos Zero) (Pos Zero)) (Pos Zero)",fontsize=16,color="black",shape="box"];1454 -> 1459[label="",style="solid", color="black", weight=3];
1455[label="toEnum4 (primEqInt (Neg (Succ yx13000)) (Pos Zero)) (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1455 -> 1460[label="",style="solid", color="black", weight=3];
1456[label="toEnum4 (primEqInt (Neg Zero) (Pos Zero)) (Neg Zero)",fontsize=16,color="black",shape="box"];1456 -> 1461[label="",style="solid", color="black", weight=3];
1457[label="takeWhile1 (numericEnumFromThenToP1 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (not (compare (fromEnum yx4) (fromEnum yx3) == LT))) (fromEnum yx3) (iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx4 - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (not (compare (fromEnum yx4) (fromEnum yx3) == LT)) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1457 -> 1462[label="",style="solid", color="black", weight=3];
1458[label="toEnum4 False (Pos (Succ yx13000))",fontsize=16,color="black",shape="box"];1458 -> 1463[label="",style="solid", color="black", weight=3];
1459[label="toEnum4 True (Pos Zero)",fontsize=16,color="black",shape="box"];1459 -> 1464[label="",style="solid", color="black", weight=3];
1460[label="toEnum4 False (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1460 -> 1465[label="",style="solid", color="black", weight=3];
1461[label="toEnum4 True (Neg Zero)",fontsize=16,color="black",shape="box"];1461 -> 1466[label="",style="solid", color="black", weight=3];
1462[label="takeWhile1 (numericEnumFromThenToP1 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (fromEnum yx4) (fromEnum yx3) == LT))) (fromEnum yx3) (iterate (fromEnum yx4 - fromEnum yx3 +) (fromEnum yx4 - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (fromEnum yx4) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (fromEnum yx4) (fromEnum yx3) == LT)) (fromEnum yx3))",fontsize=16,color="burlywood",shape="box"];2665[label="yx4/LT",fontsize=10,color="white",style="solid",shape="box"];1462 -> 2665[label="",style="solid", color="burlywood", weight=9];
2665 -> 1467[label="",style="solid", color="burlywood", weight=3];
2666[label="yx4/EQ",fontsize=10,color="white",style="solid",shape="box"];1462 -> 2666[label="",style="solid", color="burlywood", weight=9];
2666 -> 1468[label="",style="solid", color="burlywood", weight=3];
2667[label="yx4/GT",fontsize=10,color="white",style="solid",shape="box"];1462 -> 2667[label="",style="solid", color="burlywood", weight=9];
2667 -> 1469[label="",style="solid", color="burlywood", weight=3];
1463[label="toEnum3 (Pos (Succ yx13000))",fontsize=16,color="black",shape="box"];1463 -> 1470[label="",style="solid", color="black", weight=3];
1464[label="LT",fontsize=16,color="green",shape="box"];1465[label="toEnum3 (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1465 -> 1471[label="",style="solid", color="black", weight=3];
1466[label="LT",fontsize=16,color="green",shape="box"];1467[label="takeWhile1 (numericEnumFromThenToP1 (fromEnum LT) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (fromEnum LT) (fromEnum yx3) == LT))) (fromEnum yx3) (iterate (fromEnum LT - fromEnum yx3 +) (fromEnum LT - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (fromEnum LT) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (fromEnum LT) (fromEnum yx3) == LT)) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1467 -> 1472[label="",style="solid", color="black", weight=3];
1468[label="takeWhile1 (numericEnumFromThenToP1 (fromEnum EQ) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (fromEnum EQ) (fromEnum yx3) == LT))) (fromEnum yx3) (iterate (fromEnum EQ - fromEnum yx3 +) (fromEnum EQ - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (fromEnum EQ) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (fromEnum EQ) (fromEnum yx3) == LT)) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1468 -> 1473[label="",style="solid", color="black", weight=3];
1469[label="takeWhile1 (numericEnumFromThenToP1 (fromEnum GT) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (fromEnum GT) (fromEnum yx3) == LT))) (fromEnum yx3) (iterate (fromEnum GT - fromEnum yx3 +) (fromEnum GT - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (fromEnum GT) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (fromEnum GT) (fromEnum yx3) == LT)) (fromEnum yx3))",fontsize=16,color="black",shape="box"];1469 -> 1474[label="",style="solid", color="black", weight=3];
1470[label="toEnum2 (Pos (Succ yx13000) == Pos (Succ Zero)) (Pos (Succ yx13000))",fontsize=16,color="black",shape="box"];1470 -> 1475[label="",style="solid", color="black", weight=3];
1471[label="toEnum2 (Neg (Succ yx13000) == Pos (Succ Zero)) (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1471 -> 1476[label="",style="solid", color="black", weight=3];
1472[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (Pos Zero) (fromEnum yx3) == LT))) (fromEnum yx3) (iterate (Pos Zero - fromEnum yx3 +) (Pos Zero - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (Pos Zero) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (Pos Zero) (fromEnum yx3) == LT)) (fromEnum yx3))",fontsize=16,color="burlywood",shape="box"];2668[label="yx3/LT",fontsize=10,color="white",style="solid",shape="box"];1472 -> 2668[label="",style="solid", color="burlywood", weight=9];
2668 -> 1477[label="",style="solid", color="burlywood", weight=3];
2669[label="yx3/EQ",fontsize=10,color="white",style="solid",shape="box"];1472 -> 2669[label="",style="solid", color="burlywood", weight=9];
2669 -> 1478[label="",style="solid", color="burlywood", weight=3];
2670[label="yx3/GT",fontsize=10,color="white",style="solid",shape="box"];1472 -> 2670[label="",style="solid", color="burlywood", weight=9];
2670 -> 1479[label="",style="solid", color="burlywood", weight=3];
1473[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (fromEnum yx3) == LT))) (fromEnum yx3) (iterate (Pos (Succ Zero) - fromEnum yx3 +) (Pos (Succ Zero) - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (fromEnum yx3) == LT)) (fromEnum yx3))",fontsize=16,color="burlywood",shape="box"];2671[label="yx3/LT",fontsize=10,color="white",style="solid",shape="box"];1473 -> 2671[label="",style="solid", color="burlywood", weight=9];
2671 -> 1480[label="",style="solid", color="burlywood", weight=3];
2672[label="yx3/EQ",fontsize=10,color="white",style="solid",shape="box"];1473 -> 2672[label="",style="solid", color="burlywood", weight=9];
2672 -> 1481[label="",style="solid", color="burlywood", weight=3];
2673[label="yx3/GT",fontsize=10,color="white",style="solid",shape="box"];1473 -> 2673[label="",style="solid", color="burlywood", weight=9];
2673 -> 1482[label="",style="solid", color="burlywood", weight=3];
1474[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum yx3) == LT))) (fromEnum yx3) (iterate (Pos (Succ (Succ Zero)) - fromEnum yx3 +) (Pos (Succ (Succ Zero)) - fromEnum yx3 + fromEnum yx3)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (fromEnum yx3) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum yx3) == LT)) (fromEnum yx3))",fontsize=16,color="burlywood",shape="box"];2674[label="yx3/LT",fontsize=10,color="white",style="solid",shape="box"];1474 -> 2674[label="",style="solid", color="burlywood", weight=9];
2674 -> 1483[label="",style="solid", color="burlywood", weight=3];
2675[label="yx3/EQ",fontsize=10,color="white",style="solid",shape="box"];1474 -> 2675[label="",style="solid", color="burlywood", weight=9];
2675 -> 1484[label="",style="solid", color="burlywood", weight=3];
2676[label="yx3/GT",fontsize=10,color="white",style="solid",shape="box"];1474 -> 2676[label="",style="solid", color="burlywood", weight=9];
2676 -> 1485[label="",style="solid", color="burlywood", weight=3];
1475[label="toEnum2 (primEqInt (Pos (Succ yx13000)) (Pos (Succ Zero))) (Pos (Succ yx13000))",fontsize=16,color="black",shape="box"];1475 -> 1486[label="",style="solid", color="black", weight=3];
1476[label="toEnum2 (primEqInt (Neg (Succ yx13000)) (Pos (Succ Zero))) (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1476 -> 1487[label="",style="solid", color="black", weight=3];
1477[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (fromEnum LT) (fromEnum yx5) (not (primCmpInt (Pos Zero) (fromEnum LT) == LT))) (fromEnum LT) (iterate (Pos Zero - fromEnum LT +) (Pos Zero - fromEnum LT + fromEnum LT)) (numericEnumFromThenToP1 (Pos Zero) (fromEnum LT) (fromEnum yx5) (not (primCmpInt (Pos Zero) (fromEnum LT) == LT)) (fromEnum LT))",fontsize=16,color="black",shape="box"];1477 -> 1488[label="",style="solid", color="black", weight=3];
1478[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (fromEnum EQ) (fromEnum yx5) (not (primCmpInt (Pos Zero) (fromEnum EQ) == LT))) (fromEnum EQ) (iterate (Pos Zero - fromEnum EQ +) (Pos Zero - fromEnum EQ + fromEnum EQ)) (numericEnumFromThenToP1 (Pos Zero) (fromEnum EQ) (fromEnum yx5) (not (primCmpInt (Pos Zero) (fromEnum EQ) == LT)) (fromEnum EQ))",fontsize=16,color="black",shape="box"];1478 -> 1489[label="",style="solid", color="black", weight=3];
1479[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (fromEnum GT) (fromEnum yx5) (not (primCmpInt (Pos Zero) (fromEnum GT) == LT))) (fromEnum GT) (iterate (Pos Zero - fromEnum GT +) (Pos Zero - fromEnum GT + fromEnum GT)) (numericEnumFromThenToP1 (Pos Zero) (fromEnum GT) (fromEnum yx5) (not (primCmpInt (Pos Zero) (fromEnum GT) == LT)) (fromEnum GT))",fontsize=16,color="black",shape="box"];1479 -> 1490[label="",style="solid", color="black", weight=3];
1480[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (fromEnum LT) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (fromEnum LT) == LT))) (fromEnum LT) (iterate (Pos (Succ Zero) - fromEnum LT +) (Pos (Succ Zero) - fromEnum LT + fromEnum LT)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (fromEnum LT) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (fromEnum LT) == LT)) (fromEnum LT))",fontsize=16,color="black",shape="box"];1480 -> 1491[label="",style="solid", color="black", weight=3];
1481[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (fromEnum EQ) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (fromEnum EQ) == LT))) (fromEnum EQ) (iterate (Pos (Succ Zero) - fromEnum EQ +) (Pos (Succ Zero) - fromEnum EQ + fromEnum EQ)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (fromEnum EQ) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (fromEnum EQ) == LT)) (fromEnum EQ))",fontsize=16,color="black",shape="box"];1481 -> 1492[label="",style="solid", color="black", weight=3];
1482[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (fromEnum GT) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (fromEnum GT) == LT))) (fromEnum GT) (iterate (Pos (Succ Zero) - fromEnum GT +) (Pos (Succ Zero) - fromEnum GT + fromEnum GT)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (fromEnum GT) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (fromEnum GT) == LT)) (fromEnum GT))",fontsize=16,color="black",shape="box"];1482 -> 1493[label="",style="solid", color="black", weight=3];
1483[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (fromEnum LT) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum LT) == LT))) (fromEnum LT) (iterate (Pos (Succ (Succ Zero)) - fromEnum LT +) (Pos (Succ (Succ Zero)) - fromEnum LT + fromEnum LT)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (fromEnum LT) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum LT) == LT)) (fromEnum LT))",fontsize=16,color="black",shape="box"];1483 -> 1494[label="",style="solid", color="black", weight=3];
1484[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (fromEnum EQ) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum EQ) == LT))) (fromEnum EQ) (iterate (Pos (Succ (Succ Zero)) - fromEnum EQ +) (Pos (Succ (Succ Zero)) - fromEnum EQ + fromEnum EQ)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (fromEnum EQ) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum EQ) == LT)) (fromEnum EQ))",fontsize=16,color="black",shape="box"];1484 -> 1495[label="",style="solid", color="black", weight=3];
1485[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (fromEnum GT) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum GT) == LT))) (fromEnum GT) (iterate (Pos (Succ (Succ Zero)) - fromEnum GT +) (Pos (Succ (Succ Zero)) - fromEnum GT + fromEnum GT)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (fromEnum GT) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum GT) == LT)) (fromEnum GT))",fontsize=16,color="black",shape="box"];1485 -> 1496[label="",style="solid", color="black", weight=3];
1486[label="toEnum2 (primEqNat yx13000 Zero) (Pos (Succ yx13000))",fontsize=16,color="burlywood",shape="box"];2677[label="yx13000/Succ yx130000",fontsize=10,color="white",style="solid",shape="box"];1486 -> 2677[label="",style="solid", color="burlywood", weight=9];
2677 -> 1497[label="",style="solid", color="burlywood", weight=3];
2678[label="yx13000/Zero",fontsize=10,color="white",style="solid",shape="box"];1486 -> 2678[label="",style="solid", color="burlywood", weight=9];
2678 -> 1498[label="",style="solid", color="burlywood", weight=3];
1487[label="toEnum2 False (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1487 -> 1499[label="",style="solid", color="black", weight=3];
1488[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos Zero) (fromEnum yx5) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos Zero) (Pos Zero) (fromEnum yx5) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) (Pos Zero))",fontsize=16,color="black",shape="box"];1488 -> 1500[label="",style="solid", color="black", weight=3];
1489[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpInt (Pos Zero) (Pos (Succ Zero)) == LT))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpInt (Pos Zero) (Pos (Succ Zero)) == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1489 -> 1501[label="",style="solid", color="black", weight=3];
1490[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpInt (Pos Zero) (Pos (Succ (Succ Zero))) == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpInt (Pos Zero) (Pos (Succ (Succ Zero))) == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1490 -> 1502[label="",style="solid", color="black", weight=3];
1491[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT)) (Pos Zero))",fontsize=16,color="black",shape="box"];1491 -> 1503[label="",style="solid", color="black", weight=3];
1492[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ Zero)) == LT))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ Zero)) == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1492 -> 1504[label="",style="solid", color="black", weight=3];
1493[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1493 -> 1505[label="",style="solid", color="black", weight=3];
1494[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos Zero) == LT))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos Zero) == LT)) (Pos Zero))",fontsize=16,color="black",shape="box"];1494 -> 1506[label="",style="solid", color="black", weight=3];
1495[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == LT))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1495 -> 1507[label="",style="solid", color="black", weight=3];
1496[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1496 -> 1508[label="",style="solid", color="black", weight=3];
1497[label="toEnum2 (primEqNat (Succ yx130000) Zero) (Pos (Succ (Succ yx130000)))",fontsize=16,color="black",shape="box"];1497 -> 1509[label="",style="solid", color="black", weight=3];
1498[label="toEnum2 (primEqNat Zero Zero) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];1498 -> 1510[label="",style="solid", color="black", weight=3];
1499[label="toEnum1 (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1499 -> 1511[label="",style="solid", color="black", weight=3];
1500[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos Zero) (fromEnum yx5) (not (EQ == LT))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos Zero) (Pos Zero) (fromEnum yx5) (not (EQ == LT)) (Pos Zero))",fontsize=16,color="black",shape="box"];1500 -> 1512[label="",style="solid", color="black", weight=3];
1501[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat Zero (Succ Zero) == LT))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat Zero (Succ Zero) == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1501 -> 1513[label="",style="solid", color="black", weight=3];
1502[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat Zero (Succ (Succ Zero)) == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat Zero (Succ (Succ Zero)) == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1502 -> 1514[label="",style="solid", color="black", weight=3];
1503[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) (not (primCmpNat (Succ Zero) Zero == LT))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) (not (primCmpNat (Succ Zero) Zero == LT)) (Pos Zero))",fontsize=16,color="black",shape="box"];1503 -> 1515[label="",style="solid", color="black", weight=3];
1504[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat (Succ Zero) (Succ Zero) == LT))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat (Succ Zero) (Succ Zero) == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1504 -> 1516[label="",style="solid", color="black", weight=3];
1505[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat (Succ Zero) (Succ (Succ Zero)) == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat (Succ Zero) (Succ (Succ Zero)) == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1505 -> 1517[label="",style="solid", color="black", weight=3];
1506[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) (not (primCmpNat (Succ (Succ Zero)) Zero == LT))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) (not (primCmpNat (Succ (Succ Zero)) Zero == LT)) (Pos Zero))",fontsize=16,color="black",shape="box"];1506 -> 1518[label="",style="solid", color="black", weight=3];
1507[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat (Succ (Succ Zero)) (Succ Zero) == LT))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat (Succ (Succ Zero)) (Succ Zero) == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1507 -> 1519[label="",style="solid", color="black", weight=3];
1508[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat (Succ (Succ Zero)) (Succ (Succ Zero)) == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat (Succ (Succ Zero)) (Succ (Succ Zero)) == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1508 -> 1520[label="",style="solid", color="black", weight=3];
1509[label="toEnum2 False (Pos (Succ (Succ yx130000)))",fontsize=16,color="black",shape="box"];1509 -> 1521[label="",style="solid", color="black", weight=3];
1510[label="toEnum2 True (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];1510 -> 1522[label="",style="solid", color="black", weight=3];
1511[label="toEnum0 (Neg (Succ yx13000) == Pos (Succ (Succ Zero))) (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1511 -> 1523[label="",style="solid", color="black", weight=3];
1512[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos Zero) (fromEnum yx5) (not False)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos Zero) (Pos Zero) (fromEnum yx5) (not False) (Pos Zero))",fontsize=16,color="black",shape="box"];1512 -> 1524[label="",style="solid", color="black", weight=3];
1513[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) (not (LT == LT))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) (not (LT == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1513 -> 1525[label="",style="solid", color="black", weight=3];
1514[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (LT == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (LT == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1514 -> 1526[label="",style="solid", color="black", weight=3];
1515[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) (not (GT == LT))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) (not (GT == LT)) (Pos Zero))",fontsize=16,color="black",shape="box"];1515 -> 1527[label="",style="solid", color="black", weight=3];
1516[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat Zero Zero == LT))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat Zero Zero == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1516 -> 1528[label="",style="solid", color="black", weight=3];
1517[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat Zero (Succ Zero) == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat Zero (Succ Zero) == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1517 -> 1529[label="",style="solid", color="black", weight=3];
1518[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) (not (GT == LT))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) (not (GT == LT)) (Pos Zero))",fontsize=16,color="black",shape="box"];1518 -> 1530[label="",style="solid", color="black", weight=3];
1519[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat (Succ Zero) Zero == LT))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not (primCmpNat (Succ Zero) Zero == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1519 -> 1531[label="",style="solid", color="black", weight=3];
1520[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat (Succ Zero) (Succ Zero) == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat (Succ Zero) (Succ Zero) == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1520 -> 1532[label="",style="solid", color="black", weight=3];
1521[label="toEnum1 (Pos (Succ (Succ yx130000)))",fontsize=16,color="black",shape="box"];1521 -> 1533[label="",style="solid", color="black", weight=3];
1522[label="EQ",fontsize=16,color="green",shape="box"];1523[label="toEnum0 (primEqInt (Neg (Succ yx13000)) (Pos (Succ (Succ Zero)))) (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1523 -> 1534[label="",style="solid", color="black", weight=3];
1524[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos Zero) (fromEnum yx5) True) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos Zero) (Pos Zero) (fromEnum yx5) True (Pos Zero))",fontsize=16,color="black",shape="box"];1524 -> 1535[label="",style="solid", color="black", weight=3];
1525[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) (not True)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) (not True) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1525 -> 1536[label="",style="solid", color="black", weight=3];
1526[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not True)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not True) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1526 -> 1537[label="",style="solid", color="black", weight=3];
1527[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) (not False)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) (not False) (Pos Zero))",fontsize=16,color="black",shape="box"];1527 -> 1538[label="",style="solid", color="black", weight=3];
1528[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not (EQ == LT))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not (EQ == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1528 -> 1539[label="",style="solid", color="black", weight=3];
1529[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (LT == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (LT == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1529 -> 1540[label="",style="solid", color="black", weight=3];
1530[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) (not False)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) (not False) (Pos Zero))",fontsize=16,color="black",shape="box"];1530 -> 1541[label="",style="solid", color="black", weight=3];
1531[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not (GT == LT))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not (GT == LT)) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1531 -> 1542[label="",style="solid", color="black", weight=3];
1532[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat Zero Zero == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (primCmpNat Zero Zero == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1532 -> 1543[label="",style="solid", color="black", weight=3];
1533[label="toEnum0 (Pos (Succ (Succ yx130000)) == Pos (Succ (Succ Zero))) (Pos (Succ (Succ yx130000)))",fontsize=16,color="black",shape="box"];1533 -> 1544[label="",style="solid", color="black", weight=3];
1534[label="toEnum0 False (Neg (Succ yx13000))",fontsize=16,color="black",shape="box"];1534 -> 1545[label="",style="solid", color="black", weight=3];
1535[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (flip (<=) (fromEnum yx5) (Pos Zero))",fontsize=16,color="black",shape="box"];1535 -> 1546[label="",style="solid", color="black", weight=3];
1536[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) False) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) False (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1536 -> 1547[label="",style="solid", color="black", weight=3];
1537[label="takeWhile1 (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) False) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) False (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1537 -> 1548[label="",style="solid", color="black", weight=3];
1538[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) True) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos Zero) (fromEnum yx5) True (Pos Zero))",fontsize=16,color="black",shape="box"];1538 -> 1549[label="",style="solid", color="black", weight=3];
1539[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not False)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) (not False) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1539 -> 1550[label="",style="solid", color="black", weight=3];
1540[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not True)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not True) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1540 -> 1551[label="",style="solid", color="black", weight=3];
1541[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) True) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos Zero) (fromEnum yx5) True (Pos Zero))",fontsize=16,color="black",shape="box"];1541 -> 1552[label="",style="solid", color="black", weight=3];
1542[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not False)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) (not False) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1542 -> 1553[label="",style="solid", color="black", weight=3];
1543[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (EQ == LT))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not (EQ == LT)) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1543 -> 1554[label="",style="solid", color="black", weight=3];
1544[label="toEnum0 (primEqInt (Pos (Succ (Succ yx130000))) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ yx130000)))",fontsize=16,color="black",shape="box"];1544 -> 1555[label="",style="solid", color="black", weight=3];
1545[label="error []",fontsize=16,color="red",shape="box"];1546[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) ((<=) Pos Zero fromEnum yx5)",fontsize=16,color="black",shape="box"];1546 -> 1556[label="",style="solid", color="black", weight=3];
1547[label="takeWhile1 (numericEnumFromThenToP0 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) otherwise) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP0 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) otherwise (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1547 -> 1557[label="",style="solid", color="black", weight=3];
1548[label="takeWhile1 (numericEnumFromThenToP0 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) otherwise) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP0 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) otherwise (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1548 -> 1558[label="",style="solid", color="black", weight=3];
1549[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (flip (<=) (fromEnum yx5) (Pos Zero))",fontsize=16,color="black",shape="box"];1549 -> 1559[label="",style="solid", color="black", weight=3];
1550[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) True) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ Zero)) (fromEnum yx5) True (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1550 -> 1560[label="",style="solid", color="black", weight=3];
1551[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) False) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) False (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1551 -> 1561[label="",style="solid", color="black", weight=3];
1552[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (flip (<=) (fromEnum yx5) (Pos Zero))",fontsize=16,color="black",shape="box"];1552 -> 1562[label="",style="solid", color="black", weight=3];
1553[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) True) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) (fromEnum yx5) True (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1553 -> 1563[label="",style="solid", color="black", weight=3];
1554[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not False)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) (not False) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1554 -> 1564[label="",style="solid", color="black", weight=3];
1555[label="toEnum0 (primEqNat (Succ yx130000) (Succ Zero)) (Pos (Succ (Succ yx130000)))",fontsize=16,color="black",shape="box"];1555 -> 1565[label="",style="solid", color="black", weight=3];
1556[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (compare (Pos Zero) (fromEnum yx5) /= GT)",fontsize=16,color="black",shape="box"];1556 -> 1566[label="",style="solid", color="black", weight=3];
1557[label="takeWhile1 (numericEnumFromThenToP0 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) True) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (numericEnumFromThenToP0 (Pos Zero) (Pos (Succ Zero)) (fromEnum yx5) True (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1557 -> 1567[label="",style="solid", color="black", weight=3];
1558[label="takeWhile1 (numericEnumFromThenToP0 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) True) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP0 (Pos Zero) (Pos (Succ (Succ Zero))) (fromEnum yx5) True (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1558 -> 1568[label="",style="solid", color="black", weight=3];
1559[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) ((<=) Pos Zero fromEnum yx5)",fontsize=16,color="black",shape="box"];1559 -> 1569[label="",style="solid", color="black", weight=3];
1560[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (flip (<=) (fromEnum yx5) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1560 -> 1570[label="",style="solid", color="black", weight=3];
1561[label="takeWhile1 (numericEnumFromThenToP0 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) otherwise) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP0 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) otherwise (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1561 -> 1571[label="",style="solid", color="black", weight=3];
1562[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) ((<=) Pos Zero fromEnum yx5)",fontsize=16,color="black",shape="box"];1562 -> 1572[label="",style="solid", color="black", weight=3];
1563[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (flip (<=) (fromEnum yx5) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1563 -> 1573[label="",style="solid", color="black", weight=3];
1564[label="takeWhile1 (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) True) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP1 (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) (fromEnum yx5) True (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1564 -> 1574[label="",style="solid", color="black", weight=3];
1565[label="toEnum0 (primEqNat yx130000 Zero) (Pos (Succ (Succ yx130000)))",fontsize=16,color="burlywood",shape="box"];2679[label="yx130000/Succ yx1300000",fontsize=10,color="white",style="solid",shape="box"];1565 -> 2679[label="",style="solid", color="burlywood", weight=9];
2679 -> 1575[label="",style="solid", color="burlywood", weight=3];
2680[label="yx130000/Zero",fontsize=10,color="white",style="solid",shape="box"];1565 -> 2680[label="",style="solid", color="burlywood", weight=9];
2680 -> 1576[label="",style="solid", color="burlywood", weight=3];
1566[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (compare (Pos Zero) (fromEnum yx5) == GT))",fontsize=16,color="black",shape="box"];1566 -> 1577[label="",style="solid", color="black", weight=3];
1567[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (flip (>=) (fromEnum yx5) (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1567 -> 1578[label="",style="solid", color="black", weight=3];
1568[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (flip (>=) (fromEnum yx5) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1568 -> 1579[label="",style="solid", color="black", weight=3];
1569[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (compare (Pos Zero) (fromEnum yx5) /= GT)",fontsize=16,color="black",shape="box"];1569 -> 1580[label="",style="solid", color="black", weight=3];
1570[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) ((<=) Pos (Succ Zero) fromEnum yx5)",fontsize=16,color="black",shape="box"];1570 -> 1581[label="",style="solid", color="black", weight=3];
1571[label="takeWhile1 (numericEnumFromThenToP0 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) True) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (numericEnumFromThenToP0 (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) (fromEnum yx5) True (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1571 -> 1582[label="",style="solid", color="black", weight=3];
1572[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (compare (Pos Zero) (fromEnum yx5) /= GT)",fontsize=16,color="black",shape="box"];1572 -> 1583[label="",style="solid", color="black", weight=3];
1573[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) ((<=) Pos (Succ Zero) fromEnum yx5)",fontsize=16,color="black",shape="box"];1573 -> 1584[label="",style="solid", color="black", weight=3];
1574[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (flip (<=) (fromEnum yx5) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1574 -> 1585[label="",style="solid", color="black", weight=3];
1575[label="toEnum0 (primEqNat (Succ yx1300000) Zero) (Pos (Succ (Succ (Succ yx1300000))))",fontsize=16,color="black",shape="box"];1575 -> 1586[label="",style="solid", color="black", weight=3];
1576[label="toEnum0 (primEqNat Zero Zero) (Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];1576 -> 1587[label="",style="solid", color="black", weight=3];
1577[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum yx5) == GT))",fontsize=16,color="burlywood",shape="box"];2681[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1577 -> 2681[label="",style="solid", color="burlywood", weight=9];
2681 -> 1588[label="",style="solid", color="burlywood", weight=3];
2682[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1577 -> 2682[label="",style="solid", color="burlywood", weight=9];
2682 -> 1589[label="",style="solid", color="burlywood", weight=3];
2683[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1577 -> 2683[label="",style="solid", color="burlywood", weight=9];
2683 -> 1590[label="",style="solid", color="burlywood", weight=3];
1578[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) ((>=) Pos (Succ Zero) fromEnum yx5)",fontsize=16,color="black",shape="box"];1578 -> 1591[label="",style="solid", color="black", weight=3];
1579[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) ((>=) Pos (Succ (Succ Zero)) fromEnum yx5)",fontsize=16,color="black",shape="box"];1579 -> 1592[label="",style="solid", color="black", weight=3];
1580[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (compare (Pos Zero) (fromEnum yx5) == GT))",fontsize=16,color="black",shape="box"];1580 -> 1593[label="",style="solid", color="black", weight=3];
1581[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (compare (Pos (Succ Zero)) (fromEnum yx5) /= GT)",fontsize=16,color="black",shape="box"];1581 -> 1594[label="",style="solid", color="black", weight=3];
1582[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (flip (>=) (fromEnum yx5) (Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1582 -> 1595[label="",style="solid", color="black", weight=3];
1583[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (compare (Pos Zero) (fromEnum yx5) == GT))",fontsize=16,color="black",shape="box"];1583 -> 1596[label="",style="solid", color="black", weight=3];
1584[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (compare (Pos (Succ Zero)) (fromEnum yx5) /= GT)",fontsize=16,color="black",shape="box"];1584 -> 1597[label="",style="solid", color="black", weight=3];
1585[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) ((<=) Pos (Succ (Succ Zero)) fromEnum yx5)",fontsize=16,color="black",shape="box"];1585 -> 1598[label="",style="solid", color="black", weight=3];
1586[label="toEnum0 False (Pos (Succ (Succ (Succ yx1300000))))",fontsize=16,color="black",shape="box"];1586 -> 1599[label="",style="solid", color="black", weight=3];
1587[label="toEnum0 True (Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];1587 -> 1600[label="",style="solid", color="black", weight=3];
1588[label="takeWhile1 (flip (<=) (fromEnum LT)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum LT) == GT))",fontsize=16,color="black",shape="box"];1588 -> 1601[label="",style="solid", color="black", weight=3];
1589[label="takeWhile1 (flip (<=) (fromEnum EQ)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum EQ) == GT))",fontsize=16,color="black",shape="box"];1589 -> 1602[label="",style="solid", color="black", weight=3];
1590[label="takeWhile1 (flip (<=) (fromEnum GT)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum GT) == GT))",fontsize=16,color="black",shape="box"];1590 -> 1603[label="",style="solid", color="black", weight=3];
1591[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (compare (Pos (Succ Zero)) (fromEnum yx5) /= LT)",fontsize=16,color="black",shape="box"];1591 -> 1604[label="",style="solid", color="black", weight=3];
1592[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (compare (Pos (Succ (Succ Zero))) (fromEnum yx5) /= LT)",fontsize=16,color="black",shape="box"];1592 -> 1605[label="",style="solid", color="black", weight=3];
1593[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum yx5) == GT))",fontsize=16,color="burlywood",shape="box"];2684[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1593 -> 2684[label="",style="solid", color="burlywood", weight=9];
2684 -> 1606[label="",style="solid", color="burlywood", weight=3];
2685[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1593 -> 2685[label="",style="solid", color="burlywood", weight=9];
2685 -> 1607[label="",style="solid", color="burlywood", weight=3];
2686[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1593 -> 2686[label="",style="solid", color="burlywood", weight=9];
2686 -> 1608[label="",style="solid", color="burlywood", weight=3];
1594[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (compare (Pos (Succ Zero)) (fromEnum yx5) == GT))",fontsize=16,color="black",shape="box"];1594 -> 1609[label="",style="solid", color="black", weight=3];
1595[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) ((>=) Pos (Succ (Succ Zero)) fromEnum yx5)",fontsize=16,color="black",shape="box"];1595 -> 1610[label="",style="solid", color="black", weight=3];
1596[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum yx5) == GT))",fontsize=16,color="burlywood",shape="box"];2687[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1596 -> 2687[label="",style="solid", color="burlywood", weight=9];
2687 -> 1611[label="",style="solid", color="burlywood", weight=3];
2688[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1596 -> 2688[label="",style="solid", color="burlywood", weight=9];
2688 -> 1612[label="",style="solid", color="burlywood", weight=3];
2689[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1596 -> 2689[label="",style="solid", color="burlywood", weight=9];
2689 -> 1613[label="",style="solid", color="burlywood", weight=3];
1597[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (compare (Pos (Succ Zero)) (fromEnum yx5) == GT))",fontsize=16,color="black",shape="box"];1597 -> 1614[label="",style="solid", color="black", weight=3];
1598[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (compare (Pos (Succ (Succ Zero))) (fromEnum yx5) /= GT)",fontsize=16,color="black",shape="box"];1598 -> 1615[label="",style="solid", color="black", weight=3];
1599[label="error []",fontsize=16,color="red",shape="box"];1600[label="GT",fontsize=16,color="green",shape="box"];1601[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1601 -> 1616[label="",style="solid", color="black", weight=3];
1602[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1602 -> 1617[label="",style="solid", color="black", weight=3];
1603[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];1603 -> 1618[label="",style="solid", color="black", weight=3];
1604[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (compare (Pos (Succ Zero)) (fromEnum yx5) == LT))",fontsize=16,color="black",shape="box"];1604 -> 1619[label="",style="solid", color="black", weight=3];
1605[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (compare (Pos (Succ (Succ Zero))) (fromEnum yx5) == LT))",fontsize=16,color="black",shape="box"];1605 -> 1620[label="",style="solid", color="black", weight=3];
1606[label="takeWhile1 (flip (<=) (fromEnum LT)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum LT) == GT))",fontsize=16,color="black",shape="box"];1606 -> 1621[label="",style="solid", color="black", weight=3];
1607[label="takeWhile1 (flip (<=) (fromEnum EQ)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum EQ) == GT))",fontsize=16,color="black",shape="box"];1607 -> 1622[label="",style="solid", color="black", weight=3];
1608[label="takeWhile1 (flip (<=) (fromEnum GT)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum GT) == GT))",fontsize=16,color="black",shape="box"];1608 -> 1623[label="",style="solid", color="black", weight=3];
1609[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum yx5) == GT))",fontsize=16,color="burlywood",shape="box"];2690[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1609 -> 2690[label="",style="solid", color="burlywood", weight=9];
2690 -> 1624[label="",style="solid", color="burlywood", weight=3];
2691[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1609 -> 2691[label="",style="solid", color="burlywood", weight=9];
2691 -> 1625[label="",style="solid", color="burlywood", weight=3];
2692[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1609 -> 2692[label="",style="solid", color="burlywood", weight=9];
2692 -> 1626[label="",style="solid", color="burlywood", weight=3];
1610[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (compare (Pos (Succ (Succ Zero))) (fromEnum yx5) /= LT)",fontsize=16,color="black",shape="box"];1610 -> 1627[label="",style="solid", color="black", weight=3];
1611[label="takeWhile1 (flip (<=) (fromEnum LT)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum LT) == GT))",fontsize=16,color="black",shape="box"];1611 -> 1628[label="",style="solid", color="black", weight=3];
1612[label="takeWhile1 (flip (<=) (fromEnum EQ)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum EQ) == GT))",fontsize=16,color="black",shape="box"];1612 -> 1629[label="",style="solid", color="black", weight=3];
1613[label="takeWhile1 (flip (<=) (fromEnum GT)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum GT) == GT))",fontsize=16,color="black",shape="box"];1613 -> 1630[label="",style="solid", color="black", weight=3];
1614[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum yx5) == GT))",fontsize=16,color="burlywood",shape="box"];2693[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1614 -> 2693[label="",style="solid", color="burlywood", weight=9];
2693 -> 1631[label="",style="solid", color="burlywood", weight=3];
2694[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1614 -> 2694[label="",style="solid", color="burlywood", weight=9];
2694 -> 1632[label="",style="solid", color="burlywood", weight=3];
2695[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1614 -> 2695[label="",style="solid", color="burlywood", weight=9];
2695 -> 1633[label="",style="solid", color="burlywood", weight=3];
1615[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (compare (Pos (Succ (Succ Zero))) (fromEnum yx5) == GT))",fontsize=16,color="black",shape="box"];1615 -> 1634[label="",style="solid", color="black", weight=3];
1616[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1616 -> 1635[label="",style="solid", color="black", weight=3];
1617[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1617 -> 1636[label="",style="solid", color="black", weight=3];
1618[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1618 -> 1637[label="",style="solid", color="black", weight=3];
1619[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum yx5) == LT))",fontsize=16,color="burlywood",shape="box"];2696[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1619 -> 2696[label="",style="solid", color="burlywood", weight=9];
2696 -> 1638[label="",style="solid", color="burlywood", weight=3];
2697[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1619 -> 2697[label="",style="solid", color="burlywood", weight=9];
2697 -> 1639[label="",style="solid", color="burlywood", weight=3];
2698[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1619 -> 2698[label="",style="solid", color="burlywood", weight=9];
2698 -> 1640[label="",style="solid", color="burlywood", weight=3];
1620[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum yx5) == LT))",fontsize=16,color="burlywood",shape="box"];2699[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1620 -> 2699[label="",style="solid", color="burlywood", weight=9];
2699 -> 1641[label="",style="solid", color="burlywood", weight=3];
2700[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1620 -> 2700[label="",style="solid", color="burlywood", weight=9];
2700 -> 1642[label="",style="solid", color="burlywood", weight=3];
2701[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1620 -> 2701[label="",style="solid", color="burlywood", weight=9];
2701 -> 1643[label="",style="solid", color="burlywood", weight=3];
1621[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1621 -> 1644[label="",style="solid", color="black", weight=3];
1622[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1622 -> 1645[label="",style="solid", color="black", weight=3];
1623[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];1623 -> 1646[label="",style="solid", color="black", weight=3];
1624[label="takeWhile1 (flip (<=) (fromEnum LT)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum LT) == GT))",fontsize=16,color="black",shape="box"];1624 -> 1647[label="",style="solid", color="black", weight=3];
1625[label="takeWhile1 (flip (<=) (fromEnum EQ)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum EQ) == GT))",fontsize=16,color="black",shape="box"];1625 -> 1648[label="",style="solid", color="black", weight=3];
1626[label="takeWhile1 (flip (<=) (fromEnum GT)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum GT) == GT))",fontsize=16,color="black",shape="box"];1626 -> 1649[label="",style="solid", color="black", weight=3];
1627[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (compare (Pos (Succ (Succ Zero))) (fromEnum yx5) == LT))",fontsize=16,color="black",shape="box"];1627 -> 1650[label="",style="solid", color="black", weight=3];
1628[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1628 -> 1651[label="",style="solid", color="black", weight=3];
1629[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1629 -> 1652[label="",style="solid", color="black", weight=3];
1630[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];1630 -> 1653[label="",style="solid", color="black", weight=3];
1631[label="takeWhile1 (flip (<=) (fromEnum LT)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum LT) == GT))",fontsize=16,color="black",shape="box"];1631 -> 1654[label="",style="solid", color="black", weight=3];
1632[label="takeWhile1 (flip (<=) (fromEnum EQ)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum EQ) == GT))",fontsize=16,color="black",shape="box"];1632 -> 1655[label="",style="solid", color="black", weight=3];
1633[label="takeWhile1 (flip (<=) (fromEnum GT)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum GT) == GT))",fontsize=16,color="black",shape="box"];1633 -> 1656[label="",style="solid", color="black", weight=3];
1634[label="takeWhile1 (flip (<=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum yx5) == GT))",fontsize=16,color="burlywood",shape="box"];2702[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1634 -> 2702[label="",style="solid", color="burlywood", weight=9];
2702 -> 1657[label="",style="solid", color="burlywood", weight=3];
2703[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1634 -> 2703[label="",style="solid", color="burlywood", weight=9];
2703 -> 1658[label="",style="solid", color="burlywood", weight=3];
2704[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1634 -> 2704[label="",style="solid", color="burlywood", weight=9];
2704 -> 1659[label="",style="solid", color="burlywood", weight=3];
1635[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1635 -> 1660[label="",style="solid", color="black", weight=3];
1636[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (LT == GT))",fontsize=16,color="black",shape="box"];1636 -> 1661[label="",style="solid", color="black", weight=3];
1637[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (LT == GT))",fontsize=16,color="black",shape="box"];1637 -> 1662[label="",style="solid", color="black", weight=3];
1638[label="takeWhile1 (flip (>=) (fromEnum LT)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum LT) == LT))",fontsize=16,color="black",shape="box"];1638 -> 1663[label="",style="solid", color="black", weight=3];
1639[label="takeWhile1 (flip (>=) (fromEnum EQ)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum EQ) == LT))",fontsize=16,color="black",shape="box"];1639 -> 1664[label="",style="solid", color="black", weight=3];
1640[label="takeWhile1 (flip (>=) (fromEnum GT)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (fromEnum GT) == LT))",fontsize=16,color="black",shape="box"];1640 -> 1665[label="",style="solid", color="black", weight=3];
1641[label="takeWhile1 (flip (>=) (fromEnum LT)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum LT) == LT))",fontsize=16,color="black",shape="box"];1641 -> 1666[label="",style="solid", color="black", weight=3];
1642[label="takeWhile1 (flip (>=) (fromEnum EQ)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum EQ) == LT))",fontsize=16,color="black",shape="box"];1642 -> 1667[label="",style="solid", color="black", weight=3];
1643[label="takeWhile1 (flip (>=) (fromEnum GT)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum GT) == LT))",fontsize=16,color="black",shape="box"];1643 -> 1668[label="",style="solid", color="black", weight=3];
1644[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1644 -> 1669[label="",style="solid", color="black", weight=3];
1645[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1645 -> 1670[label="",style="solid", color="black", weight=3];
1646[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1646 -> 1671[label="",style="solid", color="black", weight=3];
1647[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1647 -> 1672[label="",style="solid", color="black", weight=3];
1648[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1648 -> 1673[label="",style="solid", color="black", weight=3];
1649[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];1649 -> 1674[label="",style="solid", color="black", weight=3];
1650[label="takeWhile1 (flip (>=) (fromEnum yx5)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum yx5) == LT))",fontsize=16,color="burlywood",shape="box"];2705[label="yx5/LT",fontsize=10,color="white",style="solid",shape="box"];1650 -> 2705[label="",style="solid", color="burlywood", weight=9];
2705 -> 1675[label="",style="solid", color="burlywood", weight=3];
2706[label="yx5/EQ",fontsize=10,color="white",style="solid",shape="box"];1650 -> 2706[label="",style="solid", color="burlywood", weight=9];
2706 -> 1676[label="",style="solid", color="burlywood", weight=3];
2707[label="yx5/GT",fontsize=10,color="white",style="solid",shape="box"];1650 -> 2707[label="",style="solid", color="burlywood", weight=9];
2707 -> 1677[label="",style="solid", color="burlywood", weight=3];
1651[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1651 -> 1678[label="",style="solid", color="black", weight=3];
1652[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1652 -> 1679[label="",style="solid", color="black", weight=3];
1653[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1653 -> 1680[label="",style="solid", color="black", weight=3];
1654[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1654 -> 1681[label="",style="solid", color="black", weight=3];
1655[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1655 -> 1682[label="",style="solid", color="black", weight=3];
1656[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];1656 -> 1683[label="",style="solid", color="black", weight=3];
1657[label="takeWhile1 (flip (<=) (fromEnum LT)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum LT) == GT))",fontsize=16,color="black",shape="box"];1657 -> 1684[label="",style="solid", color="black", weight=3];
1658[label="takeWhile1 (flip (<=) (fromEnum EQ)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum EQ) == GT))",fontsize=16,color="black",shape="box"];1658 -> 1685[label="",style="solid", color="black", weight=3];
1659[label="takeWhile1 (flip (<=) (fromEnum GT)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum GT) == GT))",fontsize=16,color="black",shape="box"];1659 -> 1686[label="",style="solid", color="black", weight=3];
1660[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) True",fontsize=16,color="black",shape="box"];1660 -> 1687[label="",style="solid", color="black", weight=3];
1661[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1661 -> 1688[label="",style="solid", color="black", weight=3];
1662[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1662 -> 1689[label="",style="solid", color="black", weight=3];
1663[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];1663 -> 1690[label="",style="solid", color="black", weight=3];
1664[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];1664 -> 1691[label="",style="solid", color="black", weight=3];
1665[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpInt (Pos (Succ Zero)) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];1665 -> 1692[label="",style="solid", color="black", weight=3];
1666[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];1666 -> 1693[label="",style="solid", color="black", weight=3];
1667[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];1667 -> 1694[label="",style="solid", color="black", weight=3];
1668[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];1668 -> 1695[label="",style="solid", color="black", weight=3];
1669[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1669 -> 1696[label="",style="solid", color="black", weight=3];
1670[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (LT == GT))",fontsize=16,color="black",shape="box"];1670 -> 1697[label="",style="solid", color="black", weight=3];
1671[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not (LT == GT))",fontsize=16,color="black",shape="box"];1671 -> 1698[label="",style="solid", color="black", weight=3];
1672[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == GT))",fontsize=16,color="black",shape="box"];1672 -> 1699[label="",style="solid", color="black", weight=3];
1673[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1673 -> 1700[label="",style="solid", color="black", weight=3];
1674[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) (Succ (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1674 -> 1701[label="",style="solid", color="black", weight=3];
1675[label="takeWhile1 (flip (>=) (fromEnum LT)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum LT) == LT))",fontsize=16,color="black",shape="box"];1675 -> 1702[label="",style="solid", color="black", weight=3];
1676[label="takeWhile1 (flip (>=) (fromEnum EQ)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum EQ) == LT))",fontsize=16,color="black",shape="box"];1676 -> 1703[label="",style="solid", color="black", weight=3];
1677[label="takeWhile1 (flip (>=) (fromEnum GT)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (fromEnum GT) == LT))",fontsize=16,color="black",shape="box"];1677 -> 1704[label="",style="solid", color="black", weight=3];
1678[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1678 -> 1705[label="",style="solid", color="black", weight=3];
1679[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (LT == GT))",fontsize=16,color="black",shape="box"];1679 -> 1706[label="",style="solid", color="black", weight=3];
1680[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not (LT == GT))",fontsize=16,color="black",shape="box"];1680 -> 1707[label="",style="solid", color="black", weight=3];
1681[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == GT))",fontsize=16,color="black",shape="box"];1681 -> 1708[label="",style="solid", color="black", weight=3];
1682[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1682 -> 1709[label="",style="solid", color="black", weight=3];
1683[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) (Succ (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1683 -> 1710[label="",style="solid", color="black", weight=3];
1684[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1684 -> 1711[label="",style="solid", color="black", weight=3];
1685[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1685 -> 1712[label="",style="solid", color="black", weight=3];
1686[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];1686 -> 1713[label="",style="solid", color="black", weight=3];
1687[label="Pos Zero : takeWhile (flip (<=) (Pos Zero)) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero))",fontsize=16,color="green",shape="box"];1687 -> 1714[label="",style="dashed", color="green", weight=3];
1688 -> 1760[label="",style="dashed", color="red", weight=0];
1688[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) True",fontsize=16,color="magenta"];1688 -> 1761[label="",style="dashed", color="magenta", weight=3];
1689[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) True",fontsize=16,color="black",shape="box"];1689 -> 1716[label="",style="solid", color="black", weight=3];
1690[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) Zero == LT))",fontsize=16,color="black",shape="box"];1690 -> 1717[label="",style="solid", color="black", weight=3];
1691[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];1691 -> 1718[label="",style="solid", color="black", weight=3];
1692[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat (Succ Zero) (Succ (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];1692 -> 1719[label="",style="solid", color="black", weight=3];
1693[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) Zero == LT))",fontsize=16,color="black",shape="box"];1693 -> 1720[label="",style="solid", color="black", weight=3];
1694[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];1694 -> 1721[label="",style="solid", color="black", weight=3];
1695[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) (Succ (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];1695 -> 1722[label="",style="solid", color="black", weight=3];
1696[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) True",fontsize=16,color="black",shape="box"];1696 -> 1723[label="",style="solid", color="black", weight=3];
1697[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1697 -> 1724[label="",style="solid", color="black", weight=3];
1698[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1698 -> 1725[label="",style="solid", color="black", weight=3];
1699[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1699 -> 1726[label="",style="solid", color="black", weight=3];
1700[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];1700 -> 1727[label="",style="solid", color="black", weight=3];
1701[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat Zero (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1701 -> 1728[label="",style="solid", color="black", weight=3];
1702[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];1702 -> 1729[label="",style="solid", color="black", weight=3];
1703[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];1703 -> 1730[label="",style="solid", color="black", weight=3];
1704[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpInt (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];1704 -> 1731[label="",style="solid", color="black", weight=3];
1705[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) True",fontsize=16,color="black",shape="box"];1705 -> 1732[label="",style="solid", color="black", weight=3];
1706[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1706 -> 1733[label="",style="solid", color="black", weight=3];
1707[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) (not False)",fontsize=16,color="black",shape="box"];1707 -> 1734[label="",style="solid", color="black", weight=3];
1708[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1708 -> 1735[label="",style="solid", color="black", weight=3];
1709[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];1709 -> 1736[label="",style="solid", color="black", weight=3];
1710[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat Zero (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1710 -> 1737[label="",style="solid", color="black", weight=3];
1711[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) Zero == GT))",fontsize=16,color="black",shape="box"];1711 -> 1738[label="",style="solid", color="black", weight=3];
1712[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1712 -> 1739[label="",style="solid", color="black", weight=3];
1713[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) (Succ (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1713 -> 1740[label="",style="solid", color="black", weight=3];
1714[label="takeWhile (flip (<=) (Pos Zero)) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero))",fontsize=16,color="black",shape="box"];1714 -> 1741[label="",style="solid", color="black", weight=3];
1761 -> 1807[label="",style="dashed", color="red", weight=0];
1761[label="iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)",fontsize=16,color="magenta"];1761 -> 1808[label="",style="dashed", color="magenta", weight=3];
1760[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) yx15 True",fontsize=16,color="black",shape="triangle"];1760 -> 1765[label="",style="solid", color="black", weight=3];
1716[label="Pos Zero : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero))",fontsize=16,color="green",shape="box"];1716 -> 1743[label="",style="dashed", color="green", weight=3];
1717[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (GT == LT))",fontsize=16,color="black",shape="box"];1717 -> 1744[label="",style="solid", color="black", weight=3];
1718[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat Zero Zero == LT))",fontsize=16,color="black",shape="box"];1718 -> 1745[label="",style="solid", color="black", weight=3];
1719[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (primCmpNat Zero (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];1719 -> 1746[label="",style="solid", color="black", weight=3];
1720[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (GT == LT))",fontsize=16,color="black",shape="box"];1720 -> 1747[label="",style="solid", color="black", weight=3];
1721[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ Zero) Zero == LT))",fontsize=16,color="black",shape="box"];1721 -> 1748[label="",style="solid", color="black", weight=3];
1722[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ Zero) (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];1722 -> 1749[label="",style="solid", color="black", weight=3];
1723[label="Pos Zero : takeWhile (flip (<=) (Pos Zero)) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero))",fontsize=16,color="green",shape="box"];1723 -> 1750[label="",style="dashed", color="green", weight=3];
1724 -> 1760[label="",style="dashed", color="red", weight=0];
1724[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) True",fontsize=16,color="magenta"];1724 -> 1762[label="",style="dashed", color="magenta", weight=3];
1725[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)) True",fontsize=16,color="black",shape="box"];1725 -> 1752[label="",style="solid", color="black", weight=3];
1726[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1726 -> 1753[label="",style="solid", color="black", weight=3];
1727[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1727 -> 1754[label="",style="solid", color="black", weight=3];
1728[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];1728 -> 1755[label="",style="solid", color="black", weight=3];
1729[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) Zero == LT))",fontsize=16,color="black",shape="box"];1729 -> 1756[label="",style="solid", color="black", weight=3];
1730[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];1730 -> 1757[label="",style="solid", color="black", weight=3];
1731[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ (Succ Zero)) (Succ (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];1731 -> 1758[label="",style="solid", color="black", weight=3];
1732[label="Pos Zero : takeWhile (flip (<=) (Pos Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero))",fontsize=16,color="green",shape="box"];1732 -> 1759[label="",style="dashed", color="green", weight=3];
1733 -> 1760[label="",style="dashed", color="red", weight=0];
1733[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) True",fontsize=16,color="magenta"];1733 -> 1763[label="",style="dashed", color="magenta", weight=3];
1734[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)) True",fontsize=16,color="black",shape="box"];1734 -> 1766[label="",style="solid", color="black", weight=3];
1735[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1735 -> 1767[label="",style="solid", color="black", weight=3];
1736[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1736 -> 1768[label="",style="solid", color="black", weight=3];
1737[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not (LT == GT))",fontsize=16,color="black",shape="box"];1737 -> 1769[label="",style="solid", color="black", weight=3];
1738[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1738 -> 1770[label="",style="solid", color="black", weight=3];
1739[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ Zero) Zero == GT))",fontsize=16,color="black",shape="box"];1739 -> 1771[label="",style="solid", color="black", weight=3];
1740[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ Zero) (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];1740 -> 1772[label="",style="solid", color="black", weight=3];
1741[label="takeWhile (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];1741 -> 1773[label="",style="solid", color="black", weight=3];
1808[label="Pos Zero",fontsize=16,color="green",shape="box"];1807[label="iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + yx17)",fontsize=16,color="black",shape="triangle"];1807 -> 1811[label="",style="solid", color="black", weight=3];
1765[label="Pos Zero : takeWhile (flip (<=) (Pos (Succ Zero))) yx15",fontsize=16,color="green",shape="box"];1765 -> 1778[label="",style="dashed", color="green", weight=3];
1743 -> 1774[label="",style="dashed", color="red", weight=0];
1743[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1743 -> 1775[label="",style="dashed", color="magenta", weight=3];
1744[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1744 -> 1779[label="",style="solid", color="black", weight=3];
1745[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (EQ == LT))",fontsize=16,color="black",shape="box"];1745 -> 1780[label="",style="solid", color="black", weight=3];
1746[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not (LT == LT))",fontsize=16,color="black",shape="box"];1746 -> 1781[label="",style="solid", color="black", weight=3];
1747[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not False)",fontsize=16,color="black",shape="box"];1747 -> 1782[label="",style="solid", color="black", weight=3];
1748[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (GT == LT))",fontsize=16,color="black",shape="box"];1748 -> 1783[label="",style="solid", color="black", weight=3];
1749[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat Zero Zero == LT))",fontsize=16,color="black",shape="box"];1749 -> 1784[label="",style="solid", color="black", weight=3];
1750[label="takeWhile (flip (<=) (Pos Zero)) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero))",fontsize=16,color="black",shape="box"];1750 -> 1785[label="",style="solid", color="black", weight=3];
1762 -> 1856[label="",style="dashed", color="red", weight=0];
1762[label="iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)",fontsize=16,color="magenta"];1762 -> 1857[label="",style="dashed", color="magenta", weight=3];
1752[label="Pos Zero : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero))",fontsize=16,color="green",shape="box"];1752 -> 1787[label="",style="dashed", color="green", weight=3];
1753[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1753 -> 1788[label="",style="solid", color="black", weight=3];
1754[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1754 -> 1789[label="",style="solid", color="black", weight=3];
1755[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1755 -> 1790[label="",style="solid", color="black", weight=3];
1756[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (GT == LT))",fontsize=16,color="black",shape="box"];1756 -> 1791[label="",style="solid", color="black", weight=3];
1757[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ Zero) Zero == LT))",fontsize=16,color="black",shape="box"];1757 -> 1792[label="",style="solid", color="black", weight=3];
1758[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat (Succ Zero) (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];1758 -> 1793[label="",style="solid", color="black", weight=3];
1759[label="takeWhile (flip (<=) (Pos Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero))",fontsize=16,color="black",shape="box"];1759 -> 1794[label="",style="solid", color="black", weight=3];
1763 -> 1871[label="",style="dashed", color="red", weight=0];
1763[label="iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)",fontsize=16,color="magenta"];1763 -> 1872[label="",style="dashed", color="magenta", weight=3];
1766[label="Pos Zero : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero))",fontsize=16,color="green",shape="box"];1766 -> 1796[label="",style="dashed", color="green", weight=3];
1767[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1767 -> 1797[label="",style="solid", color="black", weight=3];
1768[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1768 -> 1798[label="",style="solid", color="black", weight=3];
1769[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1769 -> 1799[label="",style="solid", color="black", weight=3];
1770[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not True)",fontsize=16,color="black",shape="box"];1770 -> 1800[label="",style="solid", color="black", weight=3];
1771[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (GT == GT))",fontsize=16,color="black",shape="box"];1771 -> 1801[label="",style="solid", color="black", weight=3];
1772[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];1772 -> 1802[label="",style="solid", color="black", weight=3];
1773[label="takeWhile2 (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];1773 -> 1803[label="",style="solid", color="black", weight=3];
1811[label="Pos Zero - Pos Zero + yx17 : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + yx17))",fontsize=16,color="green",shape="box"];1811 -> 1842[label="",style="dashed", color="green", weight=3];
1811 -> 1843[label="",style="dashed", color="green", weight=3];
1778[label="takeWhile (flip (<=) (Pos (Succ Zero))) yx15",fontsize=16,color="burlywood",shape="triangle"];2715[label="yx15/yx150 : yx151",fontsize=10,color="white",style="solid",shape="box"];1778 -> 2715[label="",style="solid", color="burlywood", weight=9];
2715 -> 1812[label="",style="solid", color="burlywood", weight=3];
2716[label="yx15/[]",fontsize=10,color="white",style="solid",shape="box"];1778 -> 2716[label="",style="solid", color="burlywood", weight=9];
2716 -> 1813[label="",style="solid", color="burlywood", weight=3];
1775 -> 1807[label="",style="dashed", color="red", weight=0];
1775[label="iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)",fontsize=16,color="magenta"];1775 -> 1810[label="",style="dashed", color="magenta", weight=3];
1774[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx16",fontsize=16,color="burlywood",shape="triangle"];2718[label="yx16/yx160 : yx161",fontsize=10,color="white",style="solid",shape="box"];1774 -> 2718[label="",style="solid", color="burlywood", weight=9];
2718 -> 1804[label="",style="solid", color="burlywood", weight=3];
2719[label="yx16/[]",fontsize=10,color="white",style="solid",shape="box"];1774 -> 2719[label="",style="solid", color="burlywood", weight=9];
2719 -> 1805[label="",style="solid", color="burlywood", weight=3];
1779[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1779 -> 1814[label="",style="solid", color="black", weight=3];
1780[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not False)",fontsize=16,color="black",shape="box"];1780 -> 1815[label="",style="solid", color="black", weight=3];
1781[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) (not True)",fontsize=16,color="black",shape="box"];1781 -> 1816[label="",style="solid", color="black", weight=3];
1782[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1782 -> 1817[label="",style="solid", color="black", weight=3];
1783[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not False)",fontsize=16,color="black",shape="box"];1783 -> 1818[label="",style="solid", color="black", weight=3];
1784[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (EQ == LT))",fontsize=16,color="black",shape="box"];1784 -> 1819[label="",style="solid", color="black", weight=3];
1785[label="takeWhile (flip (<=) (Pos Zero)) (Pos (Succ Zero) - Pos Zero + Pos Zero : iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + (Pos (Succ Zero) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];1785 -> 1820[label="",style="solid", color="black", weight=3];
1857[label="Pos Zero",fontsize=16,color="green",shape="box"];1856[label="iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + yx19)",fontsize=16,color="black",shape="triangle"];1856 -> 1860[label="",style="solid", color="black", weight=3];
1787 -> 1774[label="",style="dashed", color="red", weight=0];
1787[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1787 -> 1823[label="",style="dashed", color="magenta", weight=3];
1788[label="takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];1788 -> 1824[label="",style="solid", color="black", weight=3];
1789[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1789 -> 1825[label="",style="solid", color="black", weight=3];
1790[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1790 -> 1826[label="",style="solid", color="black", weight=3];
1791[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not False)",fontsize=16,color="black",shape="box"];1791 -> 1827[label="",style="solid", color="black", weight=3];
1792[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (GT == LT))",fontsize=16,color="black",shape="box"];1792 -> 1828[label="",style="solid", color="black", weight=3];
1793[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (primCmpNat Zero Zero == LT))",fontsize=16,color="black",shape="box"];1793 -> 1829[label="",style="solid", color="black", weight=3];
1794[label="takeWhile (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero : iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];1794 -> 1830[label="",style="solid", color="black", weight=3];
1872[label="Pos Zero",fontsize=16,color="green",shape="box"];1871[label="iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + yx20)",fontsize=16,color="black",shape="triangle"];1871 -> 1875[label="",style="solid", color="black", weight=3];
1796 -> 1774[label="",style="dashed", color="red", weight=0];
1796[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1796 -> 1833[label="",style="dashed", color="magenta", weight=3];
1797[label="takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];1797 -> 1834[label="",style="solid", color="black", weight=3];
1798[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1798 -> 1835[label="",style="solid", color="black", weight=3];
1799[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1799 -> 1836[label="",style="solid", color="black", weight=3];
1800[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) False",fontsize=16,color="black",shape="box"];1800 -> 1837[label="",style="solid", color="black", weight=3];
1801[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not True)",fontsize=16,color="black",shape="box"];1801 -> 1838[label="",style="solid", color="black", weight=3];
1802[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (EQ == GT))",fontsize=16,color="black",shape="box"];1802 -> 1839[label="",style="solid", color="black", weight=3];
1803 -> 1885[label="",style="dashed", color="red", weight=0];
1803[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (flip (<=) (Pos Zero) (Pos Zero - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1803 -> 1886[label="",style="dashed", color="magenta", weight=3];
1803 -> 1887[label="",style="dashed", color="magenta", weight=3];
1803 -> 1888[label="",style="dashed", color="magenta", weight=3];
1842[label="Pos Zero - Pos Zero + yx17",fontsize=16,color="black",shape="triangle"];1842 -> 1861[label="",style="solid", color="black", weight=3];
1843 -> 1807[label="",style="dashed", color="red", weight=0];
1843[label="iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + yx17))",fontsize=16,color="magenta"];1843 -> 1862[label="",style="dashed", color="magenta", weight=3];
1812[label="takeWhile (flip (<=) (Pos (Succ Zero))) (yx150 : yx151)",fontsize=16,color="black",shape="box"];1812 -> 1844[label="",style="solid", color="black", weight=3];
1813[label="takeWhile (flip (<=) (Pos (Succ Zero))) []",fontsize=16,color="black",shape="box"];1813 -> 1845[label="",style="solid", color="black", weight=3];
1810[label="Pos Zero",fontsize=16,color="green",shape="box"];1804[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (yx160 : yx161)",fontsize=16,color="black",shape="box"];1804 -> 1846[label="",style="solid", color="black", weight=3];
1805[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) []",fontsize=16,color="black",shape="box"];1805 -> 1847[label="",style="solid", color="black", weight=3];
1814[label="Pos (Succ Zero) : takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1814 -> 1848[label="",style="dashed", color="green", weight=3];
1815[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1815 -> 1849[label="",style="solid", color="black", weight=3];
1816[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) False",fontsize=16,color="black",shape="box"];1816 -> 1850[label="",style="solid", color="black", weight=3];
1817[label="Pos (Succ (Succ Zero)) : takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="green",shape="box"];1817 -> 1851[label="",style="dashed", color="green", weight=3];
1818[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1818 -> 1852[label="",style="solid", color="black", weight=3];
1819[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not False)",fontsize=16,color="black",shape="box"];1819 -> 1853[label="",style="solid", color="black", weight=3];
1820[label="takeWhile2 (flip (<=) (Pos Zero)) (Pos (Succ Zero) - Pos Zero + Pos Zero : iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + (Pos (Succ Zero) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];1820 -> 1854[label="",style="solid", color="black", weight=3];
1860[label="Pos (Succ Zero) - Pos Zero + yx19 : iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + (Pos (Succ Zero) - Pos Zero + yx19))",fontsize=16,color="green",shape="box"];1860 -> 1876[label="",style="dashed", color="green", weight=3];
1860 -> 1877[label="",style="dashed", color="green", weight=3];
1823 -> 1856[label="",style="dashed", color="red", weight=0];
1823[label="iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + Pos Zero)",fontsize=16,color="magenta"];1823 -> 1859[label="",style="dashed", color="magenta", weight=3];
1824[label="takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1824 -> 1863[label="",style="solid", color="black", weight=3];
1825[label="Pos (Succ Zero) : takeWhile (flip (<=) (Pos (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1825 -> 1864[label="",style="dashed", color="green", weight=3];
1826[label="Pos (Succ Zero) : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1826 -> 1865[label="",style="dashed", color="green", weight=3];
1827[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1827 -> 1866[label="",style="solid", color="black", weight=3];
1828[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not False)",fontsize=16,color="black",shape="box"];1828 -> 1867[label="",style="solid", color="black", weight=3];
1829[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not (EQ == LT))",fontsize=16,color="black",shape="box"];1829 -> 1868[label="",style="solid", color="black", weight=3];
1830[label="takeWhile2 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero : iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];1830 -> 1869[label="",style="solid", color="black", weight=3];
1875[label="Pos (Succ (Succ Zero)) - Pos Zero + yx20 : iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + (Pos (Succ (Succ Zero)) - Pos Zero + yx20))",fontsize=16,color="green",shape="box"];1875 -> 1897[label="",style="dashed", color="green", weight=3];
1875 -> 1898[label="",style="dashed", color="green", weight=3];
1833 -> 1871[label="",style="dashed", color="red", weight=0];
1833[label="iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero)",fontsize=16,color="magenta"];1833 -> 1874[label="",style="dashed", color="magenta", weight=3];
1834[label="takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ Zero)) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1834 -> 1878[label="",style="solid", color="black", weight=3];
1835[label="Pos (Succ Zero) : takeWhile (flip (<=) (Pos (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1835 -> 1879[label="",style="dashed", color="green", weight=3];
1836[label="Pos (Succ Zero) : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1836 -> 1880[label="",style="dashed", color="green", weight=3];
1837[label="takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) otherwise",fontsize=16,color="black",shape="box"];1837 -> 1881[label="",style="solid", color="black", weight=3];
1838[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) False",fontsize=16,color="black",shape="box"];1838 -> 1882[label="",style="solid", color="black", weight=3];
1839[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not False)",fontsize=16,color="black",shape="box"];1839 -> 1883[label="",style="solid", color="black", weight=3];
1886 -> 1807[label="",style="dashed", color="red", weight=0];
1886[label="iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1886 -> 1899[label="",style="dashed", color="magenta", weight=3];
1887 -> 1842[label="",style="dashed", color="red", weight=0];
1887[label="Pos Zero - Pos Zero + Pos Zero",fontsize=16,color="magenta"];1887 -> 1900[label="",style="dashed", color="magenta", weight=3];
1888 -> 1842[label="",style="dashed", color="red", weight=0];
1888[label="Pos Zero - Pos Zero + Pos Zero",fontsize=16,color="magenta"];1888 -> 1901[label="",style="dashed", color="magenta", weight=3];
1885[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (flip (<=) (Pos Zero) yx22)",fontsize=16,color="black",shape="triangle"];1885 -> 1902[label="",style="solid", color="black", weight=3];
1861 -> 2119[label="",style="dashed", color="red", weight=0];
1861[label="primPlusInt (Pos Zero - Pos Zero) yx17",fontsize=16,color="magenta"];1861 -> 2120[label="",style="dashed", color="magenta", weight=3];
1861 -> 2121[label="",style="dashed", color="magenta", weight=3];
1862 -> 1842[label="",style="dashed", color="red", weight=0];
1862[label="Pos Zero - Pos Zero + yx17",fontsize=16,color="magenta"];1844[label="takeWhile2 (flip (<=) (Pos (Succ Zero))) (yx150 : yx151)",fontsize=16,color="black",shape="box"];1844 -> 1904[label="",style="solid", color="black", weight=3];
1845[label="takeWhile3 (flip (<=) (Pos (Succ Zero))) []",fontsize=16,color="black",shape="box"];1845 -> 1905[label="",style="solid", color="black", weight=3];
1846[label="takeWhile2 (flip (<=) (Pos (Succ (Succ Zero)))) (yx160 : yx161)",fontsize=16,color="black",shape="box"];1846 -> 1906[label="",style="solid", color="black", weight=3];
1847[label="takeWhile3 (flip (<=) (Pos (Succ (Succ Zero)))) []",fontsize=16,color="black",shape="box"];1847 -> 1907[label="",style="solid", color="black", weight=3];
1848[label="takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1848 -> 1908[label="",style="solid", color="black", weight=3];
1849[label="Pos (Succ Zero) : takeWhile (flip (>=) (Pos (Succ Zero))) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1849 -> 1909[label="",style="dashed", color="green", weight=3];
1850[label="takeWhile0 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) otherwise",fontsize=16,color="black",shape="box"];1850 -> 1910[label="",style="solid", color="black", weight=3];
1851[label="takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1851 -> 1911[label="",style="solid", color="black", weight=3];
1852[label="Pos (Succ (Succ Zero)) : takeWhile (flip (>=) (Pos (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="green",shape="box"];1852 -> 1912[label="",style="dashed", color="green", weight=3];
1853[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1853 -> 1913[label="",style="solid", color="black", weight=3];
1854 -> 1885[label="",style="dashed", color="red", weight=0];
1854[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ Zero) - Pos Zero + Pos Zero) (iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + (Pos (Succ Zero) - Pos Zero + Pos Zero))) (flip (<=) (Pos Zero) (Pos (Succ Zero) - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1854 -> 1891[label="",style="dashed", color="magenta", weight=3];
1854 -> 1892[label="",style="dashed", color="magenta", weight=3];
1854 -> 1893[label="",style="dashed", color="magenta", weight=3];
1876[label="Pos (Succ Zero) - Pos Zero + yx19",fontsize=16,color="black",shape="triangle"];1876 -> 1914[label="",style="solid", color="black", weight=3];
1877 -> 1856[label="",style="dashed", color="red", weight=0];
1877[label="iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + (Pos (Succ Zero) - Pos Zero + yx19))",fontsize=16,color="magenta"];1877 -> 1915[label="",style="dashed", color="magenta", weight=3];
1859[label="Pos Zero",fontsize=16,color="green",shape="box"];1863[label="[]",fontsize=16,color="green",shape="box"];1864 -> 1778[label="",style="dashed", color="red", weight=0];
1864[label="takeWhile (flip (<=) (Pos (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="magenta"];1864 -> 1916[label="",style="dashed", color="magenta", weight=3];
1865 -> 1774[label="",style="dashed", color="red", weight=0];
1865[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="magenta"];1865 -> 1917[label="",style="dashed", color="magenta", weight=3];
1866[label="Pos (Succ (Succ Zero)) : takeWhile (flip (>=) (Pos Zero)) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="green",shape="box"];1866 -> 1918[label="",style="dashed", color="green", weight=3];
1867[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1867 -> 1919[label="",style="solid", color="black", weight=3];
1868[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) (not False)",fontsize=16,color="black",shape="box"];1868 -> 1920[label="",style="solid", color="black", weight=3];
1869 -> 1885[label="",style="dashed", color="red", weight=0];
1869[label="takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero) (iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero))) (flip (<=) (Pos Zero) (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1869 -> 1894[label="",style="dashed", color="magenta", weight=3];
1869 -> 1895[label="",style="dashed", color="magenta", weight=3];
1869 -> 1896[label="",style="dashed", color="magenta", weight=3];
1897[label="Pos (Succ (Succ Zero)) - Pos Zero + yx20",fontsize=16,color="black",shape="triangle"];1897 -> 1931[label="",style="solid", color="black", weight=3];
1898 -> 1871[label="",style="dashed", color="red", weight=0];
1898[label="iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + (Pos (Succ (Succ Zero)) - Pos Zero + yx20))",fontsize=16,color="magenta"];1898 -> 1932[label="",style="dashed", color="magenta", weight=3];
1874[label="Pos Zero",fontsize=16,color="green",shape="box"];1878[label="[]",fontsize=16,color="green",shape="box"];1879 -> 1778[label="",style="dashed", color="red", weight=0];
1879[label="takeWhile (flip (<=) (Pos (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="magenta"];1879 -> 1921[label="",style="dashed", color="magenta", weight=3];
1880 -> 1774[label="",style="dashed", color="red", weight=0];
1880[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="magenta"];1880 -> 1922[label="",style="dashed", color="magenta", weight=3];
1881[label="takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1881 -> 1923[label="",style="solid", color="black", weight=3];
1882[label="takeWhile0 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) otherwise",fontsize=16,color="black",shape="box"];1882 -> 1924[label="",style="solid", color="black", weight=3];
1883[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1883 -> 1925[label="",style="solid", color="black", weight=3];
1899 -> 1842[label="",style="dashed", color="red", weight=0];
1899[label="Pos Zero - Pos Zero + Pos Zero",fontsize=16,color="magenta"];1899 -> 1933[label="",style="dashed", color="magenta", weight=3];
1900[label="Pos Zero",fontsize=16,color="green",shape="box"];1901[label="Pos Zero",fontsize=16,color="green",shape="box"];1902[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 ((<=) yx22 Pos Zero)",fontsize=16,color="black",shape="box"];1902 -> 1934[label="",style="solid", color="black", weight=3];
2120[label="Pos Zero - Pos Zero",fontsize=16,color="black",shape="box"];2120 -> 2159[label="",style="solid", color="black", weight=3];
2121[label="yx17",fontsize=16,color="green",shape="box"];2119[label="primPlusInt yx26 yx23",fontsize=16,color="burlywood",shape="triangle"];2740[label="yx26/Pos yx260",fontsize=10,color="white",style="solid",shape="box"];2119 -> 2740[label="",style="solid", color="burlywood", weight=9];
2740 -> 2160[label="",style="solid", color="burlywood", weight=3];
2741[label="yx26/Neg yx260",fontsize=10,color="white",style="solid",shape="box"];2119 -> 2741[label="",style="solid", color="burlywood", weight=9];
2741 -> 2161[label="",style="solid", color="burlywood", weight=3];
1904[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) yx150 yx151 (flip (<=) (Pos (Succ Zero)) yx150)",fontsize=16,color="black",shape="box"];1904 -> 1936[label="",style="solid", color="black", weight=3];
1905[label="[]",fontsize=16,color="green",shape="box"];1906[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) yx160 yx161 (flip (<=) (Pos (Succ (Succ Zero))) yx160)",fontsize=16,color="black",shape="box"];1906 -> 1937[label="",style="solid", color="black", weight=3];
1907[label="[]",fontsize=16,color="green",shape="box"];1908[label="takeWhile (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero) : iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1908 -> 1938[label="",style="solid", color="black", weight=3];
1909[label="takeWhile (flip (>=) (Pos (Succ Zero))) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1909 -> 1939[label="",style="solid", color="black", weight=3];
1910[label="takeWhile0 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))) True",fontsize=16,color="black",shape="box"];1910 -> 1940[label="",style="solid", color="black", weight=3];
1911[label="takeWhile (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1911 -> 1941[label="",style="solid", color="black", weight=3];
1912[label="takeWhile (flip (>=) (Pos (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1912 -> 1942[label="",style="solid", color="black", weight=3];
1913[label="Pos (Succ (Succ Zero)) : takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="green",shape="box"];1913 -> 1943[label="",style="dashed", color="green", weight=3];
1891 -> 1856[label="",style="dashed", color="red", weight=0];
1891[label="iterate (Pos (Succ Zero) - Pos Zero +) (Pos (Succ Zero) - Pos Zero + (Pos (Succ Zero) - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1891 -> 1926[label="",style="dashed", color="magenta", weight=3];
1892 -> 1876[label="",style="dashed", color="red", weight=0];
1892[label="Pos (Succ Zero) - Pos Zero + Pos Zero",fontsize=16,color="magenta"];1892 -> 1927[label="",style="dashed", color="magenta", weight=3];
1893 -> 1876[label="",style="dashed", color="red", weight=0];
1893[label="Pos (Succ Zero) - Pos Zero + Pos Zero",fontsize=16,color="magenta"];1893 -> 1928[label="",style="dashed", color="magenta", weight=3];
1914 -> 2119[label="",style="dashed", color="red", weight=0];
1914[label="primPlusInt (Pos (Succ Zero) - Pos Zero) yx19",fontsize=16,color="magenta"];1914 -> 2124[label="",style="dashed", color="magenta", weight=3];
1914 -> 2125[label="",style="dashed", color="magenta", weight=3];
1915 -> 1876[label="",style="dashed", color="red", weight=0];
1915[label="Pos (Succ Zero) - Pos Zero + yx19",fontsize=16,color="magenta"];1916 -> 1988[label="",style="dashed", color="red", weight=0];
1916[label="iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))",fontsize=16,color="magenta"];1916 -> 1989[label="",style="dashed", color="magenta", weight=3];
1917 -> 1988[label="",style="dashed", color="red", weight=0];
1917[label="iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + Pos (Succ Zero))",fontsize=16,color="magenta"];1917 -> 1990[label="",style="dashed", color="magenta", weight=3];
1918[label="takeWhile (flip (>=) (Pos Zero)) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1918 -> 1946[label="",style="solid", color="black", weight=3];
1919[label="Pos (Succ (Succ Zero)) : takeWhile (flip (>=) (Pos (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="green",shape="box"];1919 -> 1947[label="",style="dashed", color="green", weight=3];
1920[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1920 -> 1948[label="",style="solid", color="black", weight=3];
1894 -> 1871[label="",style="dashed", color="red", weight=0];
1894[label="iterate (Pos (Succ (Succ Zero)) - Pos Zero +) (Pos (Succ (Succ Zero)) - Pos Zero + (Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero))",fontsize=16,color="magenta"];1894 -> 1929[label="",style="dashed", color="magenta", weight=3];
1895[label="Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero",fontsize=16,color="black",shape="triangle"];1895 -> 1930[label="",style="solid", color="black", weight=3];
1896 -> 1895[label="",style="dashed", color="red", weight=0];
1896[label="Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero",fontsize=16,color="magenta"];1931 -> 2119[label="",style="dashed", color="red", weight=0];
1931[label="primPlusInt (Pos (Succ (Succ Zero)) - Pos Zero) yx20",fontsize=16,color="magenta"];1931 -> 2126[label="",style="dashed", color="magenta", weight=3];
1931 -> 2127[label="",style="dashed", color="magenta", weight=3];
1932 -> 1897[label="",style="dashed", color="red", weight=0];
1932[label="Pos (Succ (Succ Zero)) - Pos Zero + yx20",fontsize=16,color="magenta"];1921 -> 1998[label="",style="dashed", color="red", weight=0];
1921[label="iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))",fontsize=16,color="magenta"];1921 -> 1999[label="",style="dashed", color="magenta", weight=3];
1922 -> 1998[label="",style="dashed", color="red", weight=0];
1922[label="iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + Pos (Succ Zero))",fontsize=16,color="magenta"];1922 -> 2000[label="",style="dashed", color="magenta", weight=3];
1923[label="[]",fontsize=16,color="green",shape="box"];1924[label="takeWhile0 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ Zero))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))) True",fontsize=16,color="black",shape="box"];1924 -> 1950[label="",style="solid", color="black", weight=3];
1925[label="Pos (Succ (Succ Zero)) : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="green",shape="box"];1925 -> 1951[label="",style="dashed", color="green", weight=3];
1933[label="Pos Zero",fontsize=16,color="green",shape="box"];1934[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (compare yx22 (Pos Zero) /= GT)",fontsize=16,color="black",shape="box"];1934 -> 1956[label="",style="solid", color="black", weight=3];
2159[label="primMinusInt (Pos Zero) (Pos Zero)",fontsize=16,color="black",shape="box"];2159 -> 2185[label="",style="solid", color="black", weight=3];
2160[label="primPlusInt (Pos yx260) yx23",fontsize=16,color="burlywood",shape="box"];2755[label="yx23/Pos yx230",fontsize=10,color="white",style="solid",shape="box"];2160 -> 2755[label="",style="solid", color="burlywood", weight=9];
2755 -> 2186[label="",style="solid", color="burlywood", weight=3];
2756[label="yx23/Neg yx230",fontsize=10,color="white",style="solid",shape="box"];2160 -> 2756[label="",style="solid", color="burlywood", weight=9];
2756 -> 2187[label="",style="solid", color="burlywood", weight=3];
2161[label="primPlusInt (Neg yx260) yx23",fontsize=16,color="burlywood",shape="box"];2757[label="yx23/Pos yx230",fontsize=10,color="white",style="solid",shape="box"];2161 -> 2757[label="",style="solid", color="burlywood", weight=9];
2757 -> 2188[label="",style="solid", color="burlywood", weight=3];
2758[label="yx23/Neg yx230",fontsize=10,color="white",style="solid",shape="box"];2161 -> 2758[label="",style="solid", color="burlywood", weight=9];
2758 -> 2189[label="",style="solid", color="burlywood", weight=3];
1936[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) yx150 yx151 ((<=) yx150 Pos (Succ Zero))",fontsize=16,color="black",shape="box"];1936 -> 1958[label="",style="solid", color="black", weight=3];
1937[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) yx160 yx161 ((<=) yx160 Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];1937 -> 1959[label="",style="solid", color="black", weight=3];
1938[label="takeWhile2 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero) : iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1938 -> 1960[label="",style="solid", color="black", weight=3];
1939[label="takeWhile (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero) : iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1939 -> 1961[label="",style="solid", color="black", weight=3];
1940[label="[]",fontsize=16,color="green",shape="box"];1941[label="takeWhile2 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1941 -> 1962[label="",style="solid", color="black", weight=3];
1942[label="takeWhile (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1942 -> 1963[label="",style="solid", color="black", weight=3];
1943[label="takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1943 -> 1964[label="",style="solid", color="black", weight=3];
1926 -> 1876[label="",style="dashed", color="red", weight=0];
1926[label="Pos (Succ Zero) - Pos Zero + Pos Zero",fontsize=16,color="magenta"];1926 -> 1952[label="",style="dashed", color="magenta", weight=3];
1927[label="Pos Zero",fontsize=16,color="green",shape="box"];1928[label="Pos Zero",fontsize=16,color="green",shape="box"];2124[label="Pos (Succ Zero) - Pos Zero",fontsize=16,color="black",shape="box"];2124 -> 2162[label="",style="solid", color="black", weight=3];
2125[label="yx19",fontsize=16,color="green",shape="box"];1989[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];1988[label="iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + yx23)",fontsize=16,color="black",shape="triangle"];1988 -> 1992[label="",style="solid", color="black", weight=3];
1990[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];1946[label="takeWhile (flip (>=) (Pos Zero)) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1946 -> 1968[label="",style="solid", color="black", weight=3];
1947[label="takeWhile (flip (>=) (Pos (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1947 -> 1969[label="",style="solid", color="black", weight=3];
1948[label="Pos (Succ (Succ Zero)) : takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="green",shape="box"];1948 -> 1970[label="",style="dashed", color="green", weight=3];
1929 -> 1897[label="",style="dashed", color="red", weight=0];
1929[label="Pos (Succ (Succ Zero)) - Pos Zero + Pos Zero",fontsize=16,color="magenta"];1929 -> 1953[label="",style="dashed", color="magenta", weight=3];
1930 -> 2119[label="",style="dashed", color="red", weight=0];
1930[label="primPlusInt (Pos (Succ (Succ Zero)) - Pos Zero) (Pos Zero)",fontsize=16,color="magenta"];1930 -> 2132[label="",style="dashed", color="magenta", weight=3];
1930 -> 2133[label="",style="dashed", color="magenta", weight=3];
2126[label="Pos (Succ (Succ Zero)) - Pos Zero",fontsize=16,color="black",shape="triangle"];2126 -> 2163[label="",style="solid", color="black", weight=3];
2127[label="yx20",fontsize=16,color="green",shape="box"];1999[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];1998[label="iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + yx24)",fontsize=16,color="black",shape="triangle"];1998 -> 2002[label="",style="solid", color="black", weight=3];
2000[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];1950[label="[]",fontsize=16,color="green",shape="box"];1951 -> 1774[label="",style="dashed", color="red", weight=0];
1951[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="magenta"];1951 -> 1973[label="",style="dashed", color="magenta", weight=3];
1956[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (compare yx22 (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];1956 -> 1976[label="",style="solid", color="black", weight=3];
2185[label="primMinusNat Zero Zero",fontsize=16,color="black",shape="box"];2185 -> 2201[label="",style="solid", color="black", weight=3];
2186[label="primPlusInt (Pos yx260) (Pos yx230)",fontsize=16,color="black",shape="box"];2186 -> 2202[label="",style="solid", color="black", weight=3];
2187[label="primPlusInt (Pos yx260) (Neg yx230)",fontsize=16,color="black",shape="box"];2187 -> 2203[label="",style="solid", color="black", weight=3];
2188[label="primPlusInt (Neg yx260) (Pos yx230)",fontsize=16,color="black",shape="box"];2188 -> 2204[label="",style="solid", color="black", weight=3];
2189[label="primPlusInt (Neg yx260) (Neg yx230)",fontsize=16,color="black",shape="box"];2189 -> 2205[label="",style="solid", color="black", weight=3];
1958[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) yx150 yx151 (compare yx150 (Pos (Succ Zero)) /= GT)",fontsize=16,color="black",shape="box"];1958 -> 1979[label="",style="solid", color="black", weight=3];
1959[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) yx160 yx161 (compare yx160 (Pos (Succ (Succ Zero))) /= GT)",fontsize=16,color="black",shape="box"];1959 -> 1980[label="",style="solid", color="black", weight=3];
1960[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) (flip (>=) (Pos Zero) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1960 -> 1981[label="",style="solid", color="black", weight=3];
1961[label="takeWhile2 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero) : iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1961 -> 1982[label="",style="solid", color="black", weight=3];
1962[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (flip (>=) (Pos Zero) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1962 -> 1983[label="",style="solid", color="black", weight=3];
1963[label="takeWhile2 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1963 -> 1984[label="",style="solid", color="black", weight=3];
1964[label="takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1964 -> 1985[label="",style="solid", color="black", weight=3];
1952[label="Pos Zero",fontsize=16,color="green",shape="box"];2162[label="primMinusInt (Pos (Succ Zero)) (Pos Zero)",fontsize=16,color="black",shape="box"];2162 -> 2190[label="",style="solid", color="black", weight=3];
1992[label="Pos (Succ Zero) - Pos (Succ Zero) + yx23 : iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + (Pos (Succ Zero) - Pos (Succ Zero) + yx23))",fontsize=16,color="green",shape="box"];1992 -> 2003[label="",style="dashed", color="green", weight=3];
1992 -> 2004[label="",style="dashed", color="green", weight=3];
1968[label="takeWhile2 (flip (>=) (Pos Zero)) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1968 -> 1993[label="",style="solid", color="black", weight=3];
1969[label="takeWhile (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1969 -> 1994[label="",style="solid", color="black", weight=3];
1970[label="takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1970 -> 1995[label="",style="solid", color="black", weight=3];
1953[label="Pos Zero",fontsize=16,color="green",shape="box"];2132 -> 2126[label="",style="dashed", color="red", weight=0];
2132[label="Pos (Succ (Succ Zero)) - Pos Zero",fontsize=16,color="magenta"];2133[label="Pos Zero",fontsize=16,color="green",shape="box"];2163[label="primMinusInt (Pos (Succ (Succ Zero))) (Pos Zero)",fontsize=16,color="black",shape="box"];2163 -> 2191[label="",style="solid", color="black", weight=3];
2002[label="Pos (Succ (Succ Zero)) - Pos (Succ Zero) + yx24 : iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + yx24))",fontsize=16,color="green",shape="box"];2002 -> 2025[label="",style="dashed", color="green", weight=3];
2002 -> 2026[label="",style="dashed", color="green", weight=3];
1973 -> 2058[label="",style="dashed", color="red", weight=0];
1973[label="iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];1973 -> 2059[label="",style="dashed", color="magenta", weight=3];
1976[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (primCmpInt yx22 (Pos Zero) == GT))",fontsize=16,color="burlywood",shape="box"];2765[label="yx22/Pos yx220",fontsize=10,color="white",style="solid",shape="box"];1976 -> 2765[label="",style="solid", color="burlywood", weight=9];
2765 -> 2006[label="",style="solid", color="burlywood", weight=3];
2766[label="yx22/Neg yx220",fontsize=10,color="white",style="solid",shape="box"];1976 -> 2766[label="",style="solid", color="burlywood", weight=9];
2766 -> 2007[label="",style="solid", color="burlywood", weight=3];
2201[label="Pos Zero",fontsize=16,color="green",shape="box"];2202[label="Pos (primPlusNat yx260 yx230)",fontsize=16,color="green",shape="box"];2202 -> 2240[label="",style="dashed", color="green", weight=3];
2203[label="primMinusNat yx260 yx230",fontsize=16,color="burlywood",shape="triangle"];2767[label="yx260/Succ yx2600",fontsize=10,color="white",style="solid",shape="box"];2203 -> 2767[label="",style="solid", color="burlywood", weight=9];
2767 -> 2241[label="",style="solid", color="burlywood", weight=3];
2768[label="yx260/Zero",fontsize=10,color="white",style="solid",shape="box"];2203 -> 2768[label="",style="solid", color="burlywood", weight=9];
2768 -> 2242[label="",style="solid", color="burlywood", weight=3];
2204 -> 2203[label="",style="dashed", color="red", weight=0];
2204[label="primMinusNat yx230 yx260",fontsize=16,color="magenta"];2204 -> 2243[label="",style="dashed", color="magenta", weight=3];
2204 -> 2244[label="",style="dashed", color="magenta", weight=3];
2205[label="Neg (primPlusNat yx260 yx230)",fontsize=16,color="green",shape="box"];2205 -> 2245[label="",style="dashed", color="green", weight=3];
1979[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) yx150 yx151 (not (compare yx150 (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];1979 -> 2010[label="",style="solid", color="black", weight=3];
1980[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) yx160 yx161 (not (compare yx160 (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];1980 -> 2011[label="",style="solid", color="black", weight=3];
1981[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) ((>=) Pos Zero - Pos (Succ Zero) + Pos (Succ Zero) Pos Zero)",fontsize=16,color="black",shape="box"];1981 -> 2012[label="",style="solid", color="black", weight=3];
1982[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) (flip (>=) (Pos (Succ Zero)) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1982 -> 2013[label="",style="solid", color="black", weight=3];
1983[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) ((>=) Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) Pos Zero)",fontsize=16,color="black",shape="box"];1983 -> 2014[label="",style="solid", color="black", weight=3];
1984[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (flip (>=) (Pos (Succ Zero)) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1984 -> 2015[label="",style="solid", color="black", weight=3];
1985[label="takeWhile2 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1985 -> 2016[label="",style="solid", color="black", weight=3];
2190[label="primMinusNat (Succ Zero) Zero",fontsize=16,color="black",shape="box"];2190 -> 2206[label="",style="solid", color="black", weight=3];
2003[label="Pos (Succ Zero) - Pos (Succ Zero) + yx23",fontsize=16,color="black",shape="triangle"];2003 -> 2027[label="",style="solid", color="black", weight=3];
2004 -> 1988[label="",style="dashed", color="red", weight=0];
2004[label="iterate (Pos (Succ Zero) - Pos (Succ Zero) +) (Pos (Succ Zero) - Pos (Succ Zero) + (Pos (Succ Zero) - Pos (Succ Zero) + yx23))",fontsize=16,color="magenta"];2004 -> 2028[label="",style="dashed", color="magenta", weight=3];
1993[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (flip (>=) (Pos Zero) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];1993 -> 2019[label="",style="solid", color="black", weight=3];
1994[label="takeWhile2 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1994 -> 2020[label="",style="solid", color="black", weight=3];
1995[label="takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];1995 -> 2021[label="",style="solid", color="black", weight=3];
2191[label="primMinusNat (Succ (Succ Zero)) Zero",fontsize=16,color="black",shape="box"];2191 -> 2207[label="",style="solid", color="black", weight=3];
2025[label="Pos (Succ (Succ Zero)) - Pos (Succ Zero) + yx24",fontsize=16,color="black",shape="triangle"];2025 -> 2054[label="",style="solid", color="black", weight=3];
2026 -> 1998[label="",style="dashed", color="red", weight=0];
2026[label="iterate (Pos (Succ (Succ Zero)) - Pos (Succ Zero) +) (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + (Pos (Succ (Succ Zero)) - Pos (Succ Zero) + yx24))",fontsize=16,color="magenta"];2026 -> 2055[label="",style="dashed", color="magenta", weight=3];
2059[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2058[label="iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + yx25)",fontsize=16,color="black",shape="triangle"];2058 -> 2061[label="",style="solid", color="black", weight=3];
2006[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (primCmpInt (Pos yx220) (Pos Zero) == GT))",fontsize=16,color="burlywood",shape="box"];2772[label="yx220/Succ yx2200",fontsize=10,color="white",style="solid",shape="box"];2006 -> 2772[label="",style="solid", color="burlywood", weight=9];
2772 -> 2031[label="",style="solid", color="burlywood", weight=3];
2773[label="yx220/Zero",fontsize=10,color="white",style="solid",shape="box"];2006 -> 2773[label="",style="solid", color="burlywood", weight=9];
2773 -> 2032[label="",style="solid", color="burlywood", weight=3];
2007[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (primCmpInt (Neg yx220) (Pos Zero) == GT))",fontsize=16,color="burlywood",shape="box"];2774[label="yx220/Succ yx2200",fontsize=10,color="white",style="solid",shape="box"];2007 -> 2774[label="",style="solid", color="burlywood", weight=9];
2774 -> 2033[label="",style="solid", color="burlywood", weight=3];
2775[label="yx220/Zero",fontsize=10,color="white",style="solid",shape="box"];2007 -> 2775[label="",style="solid", color="burlywood", weight=9];
2775 -> 2034[label="",style="solid", color="burlywood", weight=3];
2240[label="primPlusNat yx260 yx230",fontsize=16,color="burlywood",shape="triangle"];2776[label="yx260/Succ yx2600",fontsize=10,color="white",style="solid",shape="box"];2240 -> 2776[label="",style="solid", color="burlywood", weight=9];
2776 -> 2258[label="",style="solid", color="burlywood", weight=3];
2777[label="yx260/Zero",fontsize=10,color="white",style="solid",shape="box"];2240 -> 2777[label="",style="solid", color="burlywood", weight=9];
2777 -> 2259[label="",style="solid", color="burlywood", weight=3];
2241[label="primMinusNat (Succ yx2600) yx230",fontsize=16,color="burlywood",shape="box"];2778[label="yx230/Succ yx2300",fontsize=10,color="white",style="solid",shape="box"];2241 -> 2778[label="",style="solid", color="burlywood", weight=9];
2778 -> 2260[label="",style="solid", color="burlywood", weight=3];
2779[label="yx230/Zero",fontsize=10,color="white",style="solid",shape="box"];2241 -> 2779[label="",style="solid", color="burlywood", weight=9];
2779 -> 2261[label="",style="solid", color="burlywood", weight=3];
2242[label="primMinusNat Zero yx230",fontsize=16,color="burlywood",shape="box"];2780[label="yx230/Succ yx2300",fontsize=10,color="white",style="solid",shape="box"];2242 -> 2780[label="",style="solid", color="burlywood", weight=9];
2780 -> 2262[label="",style="solid", color="burlywood", weight=3];
2781[label="yx230/Zero",fontsize=10,color="white",style="solid",shape="box"];2242 -> 2781[label="",style="solid", color="burlywood", weight=9];
2781 -> 2263[label="",style="solid", color="burlywood", weight=3];
2243[label="yx230",fontsize=16,color="green",shape="box"];2244[label="yx260",fontsize=16,color="green",shape="box"];2245 -> 2240[label="",style="dashed", color="red", weight=0];
2245[label="primPlusNat yx260 yx230",fontsize=16,color="magenta"];2245 -> 2264[label="",style="dashed", color="magenta", weight=3];
2245 -> 2265[label="",style="dashed", color="magenta", weight=3];
2010[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) yx150 yx151 (not (primCmpInt yx150 (Pos (Succ Zero)) == GT))",fontsize=16,color="burlywood",shape="box"];2783[label="yx150/Pos yx1500",fontsize=10,color="white",style="solid",shape="box"];2010 -> 2783[label="",style="solid", color="burlywood", weight=9];
2783 -> 2038[label="",style="solid", color="burlywood", weight=3];
2784[label="yx150/Neg yx1500",fontsize=10,color="white",style="solid",shape="box"];2010 -> 2784[label="",style="solid", color="burlywood", weight=9];
2784 -> 2039[label="",style="solid", color="burlywood", weight=3];
2011[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) yx160 yx161 (not (primCmpInt yx160 (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="burlywood",shape="box"];2785[label="yx160/Pos yx1600",fontsize=10,color="white",style="solid",shape="box"];2011 -> 2785[label="",style="solid", color="burlywood", weight=9];
2785 -> 2040[label="",style="solid", color="burlywood", weight=3];
2786[label="yx160/Neg yx1600",fontsize=10,color="white",style="solid",shape="box"];2011 -> 2786[label="",style="solid", color="burlywood", weight=9];
2786 -> 2041[label="",style="solid", color="burlywood", weight=3];
2012[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) (compare (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (Pos Zero) /= LT)",fontsize=16,color="black",shape="box"];2012 -> 2042[label="",style="solid", color="black", weight=3];
2013[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) ((>=) Pos Zero - Pos (Succ Zero) + Pos (Succ Zero) Pos (Succ Zero))",fontsize=16,color="black",shape="box"];2013 -> 2043[label="",style="solid", color="black", weight=3];
2014[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (compare (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos Zero) /= LT)",fontsize=16,color="black",shape="box"];2014 -> 2044[label="",style="solid", color="black", weight=3];
2015[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) ((>=) Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) Pos (Succ Zero))",fontsize=16,color="black",shape="box"];2015 -> 2045[label="",style="solid", color="black", weight=3];
2016[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (flip (>=) (Pos (Succ (Succ Zero))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];2016 -> 2046[label="",style="solid", color="black", weight=3];
2206[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];2027 -> 2119[label="",style="dashed", color="red", weight=0];
2027[label="primPlusInt (Pos (Succ Zero) - Pos (Succ Zero)) yx23",fontsize=16,color="magenta"];2027 -> 2150[label="",style="dashed", color="magenta", weight=3];
2028 -> 2003[label="",style="dashed", color="red", weight=0];
2028[label="Pos (Succ Zero) - Pos (Succ Zero) + yx23",fontsize=16,color="magenta"];2019[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) ((>=) Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) Pos Zero)",fontsize=16,color="black",shape="box"];2019 -> 2049[label="",style="solid", color="black", weight=3];
2020[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (flip (>=) (Pos (Succ Zero)) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];2020 -> 2050[label="",style="solid", color="black", weight=3];
2021[label="takeWhile2 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) : iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];2021 -> 2051[label="",style="solid", color="black", weight=3];
2207[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2054 -> 2119[label="",style="dashed", color="red", weight=0];
2054[label="primPlusInt (Pos (Succ (Succ Zero)) - Pos (Succ Zero)) yx24",fontsize=16,color="magenta"];2054 -> 2151[label="",style="dashed", color="magenta", weight=3];
2054 -> 2152[label="",style="dashed", color="magenta", weight=3];
2055 -> 2025[label="",style="dashed", color="red", weight=0];
2055[label="Pos (Succ (Succ Zero)) - Pos (Succ Zero) + yx24",fontsize=16,color="magenta"];2061[label="Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + yx25 : iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + yx25))",fontsize=16,color="green",shape="box"];2061 -> 2094[label="",style="dashed", color="green", weight=3];
2061 -> 2095[label="",style="dashed", color="green", weight=3];
2031[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (primCmpInt (Pos (Succ yx2200)) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];2031 -> 2063[label="",style="solid", color="black", weight=3];
2032[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (primCmpInt (Pos Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];2032 -> 2064[label="",style="solid", color="black", weight=3];
2033[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (primCmpInt (Neg (Succ yx2200)) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];2033 -> 2065[label="",style="solid", color="black", weight=3];
2034[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (primCmpInt (Neg Zero) (Pos Zero) == GT))",fontsize=16,color="black",shape="box"];2034 -> 2066[label="",style="solid", color="black", weight=3];
2258[label="primPlusNat (Succ yx2600) yx230",fontsize=16,color="burlywood",shape="box"];2791[label="yx230/Succ yx2300",fontsize=10,color="white",style="solid",shape="box"];2258 -> 2791[label="",style="solid", color="burlywood", weight=9];
2791 -> 2273[label="",style="solid", color="burlywood", weight=3];
2792[label="yx230/Zero",fontsize=10,color="white",style="solid",shape="box"];2258 -> 2792[label="",style="solid", color="burlywood", weight=9];
2792 -> 2274[label="",style="solid", color="burlywood", weight=3];
2259[label="primPlusNat Zero yx230",fontsize=16,color="burlywood",shape="box"];2793[label="yx230/Succ yx2300",fontsize=10,color="white",style="solid",shape="box"];2259 -> 2793[label="",style="solid", color="burlywood", weight=9];
2793 -> 2275[label="",style="solid", color="burlywood", weight=3];
2794[label="yx230/Zero",fontsize=10,color="white",style="solid",shape="box"];2259 -> 2794[label="",style="solid", color="burlywood", weight=9];
2794 -> 2276[label="",style="solid", color="burlywood", weight=3];
2260[label="primMinusNat (Succ yx2600) (Succ yx2300)",fontsize=16,color="black",shape="box"];2260 -> 2277[label="",style="solid", color="black", weight=3];
2261[label="primMinusNat (Succ yx2600) Zero",fontsize=16,color="black",shape="box"];2261 -> 2278[label="",style="solid", color="black", weight=3];
2262[label="primMinusNat Zero (Succ yx2300)",fontsize=16,color="black",shape="box"];2262 -> 2279[label="",style="solid", color="black", weight=3];
2263[label="primMinusNat Zero Zero",fontsize=16,color="black",shape="box"];2263 -> 2280[label="",style="solid", color="black", weight=3];
2264[label="yx260",fontsize=16,color="green",shape="box"];2265[label="yx230",fontsize=16,color="green",shape="box"];2038[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos yx1500) yx151 (not (primCmpInt (Pos yx1500) (Pos (Succ Zero)) == GT))",fontsize=16,color="burlywood",shape="box"];2795[label="yx1500/Succ yx15000",fontsize=10,color="white",style="solid",shape="box"];2038 -> 2795[label="",style="solid", color="burlywood", weight=9];
2795 -> 2071[label="",style="solid", color="burlywood", weight=3];
2796[label="yx1500/Zero",fontsize=10,color="white",style="solid",shape="box"];2038 -> 2796[label="",style="solid", color="burlywood", weight=9];
2796 -> 2072[label="",style="solid", color="burlywood", weight=3];
2039[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg yx1500) yx151 (not (primCmpInt (Neg yx1500) (Pos (Succ Zero)) == GT))",fontsize=16,color="burlywood",shape="box"];2797[label="yx1500/Succ yx15000",fontsize=10,color="white",style="solid",shape="box"];2039 -> 2797[label="",style="solid", color="burlywood", weight=9];
2797 -> 2073[label="",style="solid", color="burlywood", weight=3];
2798[label="yx1500/Zero",fontsize=10,color="white",style="solid",shape="box"];2039 -> 2798[label="",style="solid", color="burlywood", weight=9];
2798 -> 2074[label="",style="solid", color="burlywood", weight=3];
2040[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos yx1600) yx161 (not (primCmpInt (Pos yx1600) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="burlywood",shape="box"];2799[label="yx1600/Succ yx16000",fontsize=10,color="white",style="solid",shape="box"];2040 -> 2799[label="",style="solid", color="burlywood", weight=9];
2799 -> 2075[label="",style="solid", color="burlywood", weight=3];
2800[label="yx1600/Zero",fontsize=10,color="white",style="solid",shape="box"];2040 -> 2800[label="",style="solid", color="burlywood", weight=9];
2800 -> 2076[label="",style="solid", color="burlywood", weight=3];
2041[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg yx1600) yx161 (not (primCmpInt (Neg yx1600) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="burlywood",shape="box"];2801[label="yx1600/Succ yx16000",fontsize=10,color="white",style="solid",shape="box"];2041 -> 2801[label="",style="solid", color="burlywood", weight=9];
2801 -> 2077[label="",style="solid", color="burlywood", weight=3];
2802[label="yx1600/Zero",fontsize=10,color="white",style="solid",shape="box"];2041 -> 2802[label="",style="solid", color="burlywood", weight=9];
2802 -> 2078[label="",style="solid", color="burlywood", weight=3];
2042[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) (not (compare (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2042 -> 2079[label="",style="solid", color="black", weight=3];
2043[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) (compare (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (Pos (Succ Zero)) /= LT)",fontsize=16,color="black",shape="box"];2043 -> 2080[label="",style="solid", color="black", weight=3];
2044[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (compare (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2044 -> 2081[label="",style="solid", color="black", weight=3];
2045[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (compare (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ Zero)) /= LT)",fontsize=16,color="black",shape="box"];2045 -> 2082[label="",style="solid", color="black", weight=3];
2046[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) ((>=) Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];2046 -> 2083[label="",style="solid", color="black", weight=3];
2150[label="Pos (Succ Zero) - Pos (Succ Zero)",fontsize=16,color="black",shape="box"];2150 -> 2164[label="",style="solid", color="black", weight=3];
2049[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (compare (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos Zero) /= LT)",fontsize=16,color="black",shape="box"];2049 -> 2088[label="",style="solid", color="black", weight=3];
2050[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) ((>=) Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) Pos (Succ Zero))",fontsize=16,color="black",shape="box"];2050 -> 2089[label="",style="solid", color="black", weight=3];
2051[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (flip (>=) (Pos (Succ (Succ Zero))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))",fontsize=16,color="black",shape="box"];2051 -> 2090[label="",style="solid", color="black", weight=3];
2151[label="Pos (Succ (Succ Zero)) - Pos (Succ Zero)",fontsize=16,color="black",shape="box"];2151 -> 2165[label="",style="solid", color="black", weight=3];
2152[label="yx24",fontsize=16,color="green",shape="box"];2094[label="Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + yx25",fontsize=16,color="black",shape="triangle"];2094 -> 2166[label="",style="solid", color="black", weight=3];
2095 -> 2058[label="",style="dashed", color="red", weight=0];
2095[label="iterate (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) +) (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + yx25))",fontsize=16,color="magenta"];2095 -> 2167[label="",style="dashed", color="magenta", weight=3];
2063[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (primCmpNat (Succ yx2200) Zero == GT))",fontsize=16,color="black",shape="box"];2063 -> 2097[label="",style="solid", color="black", weight=3];
2064[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (EQ == GT))",fontsize=16,color="black",shape="triangle"];2064 -> 2098[label="",style="solid", color="black", weight=3];
2065[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (LT == GT))",fontsize=16,color="black",shape="box"];2065 -> 2099[label="",style="solid", color="black", weight=3];
2066 -> 2064[label="",style="dashed", color="red", weight=0];
2066[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (EQ == GT))",fontsize=16,color="magenta"];2273[label="primPlusNat (Succ yx2600) (Succ yx2300)",fontsize=16,color="black",shape="box"];2273 -> 2329[label="",style="solid", color="black", weight=3];
2274[label="primPlusNat (Succ yx2600) Zero",fontsize=16,color="black",shape="box"];2274 -> 2330[label="",style="solid", color="black", weight=3];
2275[label="primPlusNat Zero (Succ yx2300)",fontsize=16,color="black",shape="box"];2275 -> 2331[label="",style="solid", color="black", weight=3];
2276[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];2276 -> 2332[label="",style="solid", color="black", weight=3];
2277 -> 2203[label="",style="dashed", color="red", weight=0];
2277[label="primMinusNat yx2600 yx2300",fontsize=16,color="magenta"];2277 -> 2333[label="",style="dashed", color="magenta", weight=3];
2277 -> 2334[label="",style="dashed", color="magenta", weight=3];
2278[label="Pos (Succ yx2600)",fontsize=16,color="green",shape="box"];2279[label="Neg (Succ yx2300)",fontsize=16,color="green",shape="box"];2280[label="Pos Zero",fontsize=16,color="green",shape="box"];2071[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ yx15000)) yx151 (not (primCmpInt (Pos (Succ yx15000)) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];2071 -> 2102[label="",style="solid", color="black", weight=3];
2072[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) yx151 (not (primCmpInt (Pos Zero) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];2072 -> 2103[label="",style="solid", color="black", weight=3];
2073[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg (Succ yx15000)) yx151 (not (primCmpInt (Neg (Succ yx15000)) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];2073 -> 2104[label="",style="solid", color="black", weight=3];
2074[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg Zero) yx151 (not (primCmpInt (Neg Zero) (Pos (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];2074 -> 2105[label="",style="solid", color="black", weight=3];
2075[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ yx16000)) yx161 (not (primCmpInt (Pos (Succ yx16000)) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];2075 -> 2106[label="",style="solid", color="black", weight=3];
2076[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) yx161 (not (primCmpInt (Pos Zero) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];2076 -> 2107[label="",style="solid", color="black", weight=3];
2077[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg (Succ yx16000)) yx161 (not (primCmpInt (Neg (Succ yx16000)) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];2077 -> 2108[label="",style="solid", color="black", weight=3];
2078[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg Zero) yx161 (not (primCmpInt (Neg Zero) (Pos (Succ (Succ Zero))) == GT))",fontsize=16,color="black",shape="box"];2078 -> 2109[label="",style="solid", color="black", weight=3];
2079[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) (not (primCmpInt (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2079 -> 2110[label="",style="solid", color="black", weight=3];
2080[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) (not (compare (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2080 -> 2111[label="",style="solid", color="black", weight=3];
2081[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (primCmpInt (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2081 -> 2112[label="",style="solid", color="black", weight=3];
2082[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (compare (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2082 -> 2113[label="",style="solid", color="black", weight=3];
2083[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (compare (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) /= LT)",fontsize=16,color="black",shape="box"];2083 -> 2114[label="",style="solid", color="black", weight=3];
2164[label="primMinusInt (Pos (Succ Zero)) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];2164 -> 2192[label="",style="solid", color="black", weight=3];
2088[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (compare (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2088 -> 2168[label="",style="solid", color="black", weight=3];
2089[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (compare (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ Zero)) /= LT)",fontsize=16,color="black",shape="box"];2089 -> 2169[label="",style="solid", color="black", weight=3];
2090[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) ((>=) Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero)) Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];2090 -> 2170[label="",style="solid", color="black", weight=3];
2165[label="primMinusInt (Pos (Succ (Succ Zero))) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];2165 -> 2193[label="",style="solid", color="black", weight=3];
2166 -> 2119[label="",style="dashed", color="red", weight=0];
2166[label="primPlusInt (Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero))) yx25",fontsize=16,color="magenta"];2166 -> 2194[label="",style="dashed", color="magenta", weight=3];
2166 -> 2195[label="",style="dashed", color="magenta", weight=3];
2167 -> 2094[label="",style="dashed", color="red", weight=0];
2167[label="Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero)) + yx25",fontsize=16,color="magenta"];2097[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not (GT == GT))",fontsize=16,color="black",shape="box"];2097 -> 2171[label="",style="solid", color="black", weight=3];
2098[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not False)",fontsize=16,color="black",shape="triangle"];2098 -> 2172[label="",style="solid", color="black", weight=3];
2099 -> 2098[label="",style="dashed", color="red", weight=0];
2099[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not False)",fontsize=16,color="magenta"];2329[label="Succ (Succ (primPlusNat yx2600 yx2300))",fontsize=16,color="green",shape="box"];2329 -> 2361[label="",style="dashed", color="green", weight=3];
2330[label="Succ yx2600",fontsize=16,color="green",shape="box"];2331[label="Succ yx2300",fontsize=16,color="green",shape="box"];2332[label="Zero",fontsize=16,color="green",shape="box"];2333[label="yx2600",fontsize=16,color="green",shape="box"];2334[label="yx2300",fontsize=16,color="green",shape="box"];2102[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ yx15000)) yx151 (not (primCmpNat (Succ yx15000) (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];2102 -> 2173[label="",style="solid", color="black", weight=3];
2103[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) yx151 (not (primCmpNat Zero (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];2103 -> 2174[label="",style="solid", color="black", weight=3];
2104[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg (Succ yx15000)) yx151 (not (LT == GT))",fontsize=16,color="black",shape="box"];2104 -> 2175[label="",style="solid", color="black", weight=3];
2105[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg Zero) yx151 (not (LT == GT))",fontsize=16,color="black",shape="box"];2105 -> 2176[label="",style="solid", color="black", weight=3];
2106[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ yx16000)) yx161 (not (primCmpNat (Succ yx16000) (Succ (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];2106 -> 2177[label="",style="solid", color="black", weight=3];
2107[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) yx161 (not (primCmpNat Zero (Succ (Succ Zero)) == GT))",fontsize=16,color="black",shape="box"];2107 -> 2178[label="",style="solid", color="black", weight=3];
2108[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg (Succ yx16000)) yx161 (not (LT == GT))",fontsize=16,color="black",shape="box"];2108 -> 2179[label="",style="solid", color="black", weight=3];
2109[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg Zero) yx161 (not (LT == GT))",fontsize=16,color="black",shape="box"];2109 -> 2180[label="",style="solid", color="black", weight=3];
2110 -> 2181[label="",style="dashed", color="red", weight=0];
2110[label="takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))) (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ Zero)) (primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))))) (not (primCmpInt (primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))) (Pos Zero) == LT))",fontsize=16,color="magenta"];2110 -> 2182[label="",style="dashed", color="magenta", weight=3];
2110 -> 2183[label="",style="dashed", color="magenta", weight=3];
2110 -> 2184[label="",style="dashed", color="magenta", weight=3];
2111[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (iterate (Pos Zero - Pos (Succ Zero) +) (Pos Zero - Pos (Succ Zero) + (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)))) (not (primCmpInt (Pos Zero - Pos (Succ Zero) + Pos (Succ Zero)) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2111 -> 2196[label="",style="solid", color="black", weight=3];
2112 -> 2197[label="",style="dashed", color="red", weight=0];
2112[label="takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))))) (not (primCmpInt (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (Pos Zero) == LT))",fontsize=16,color="magenta"];2112 -> 2198[label="",style="dashed", color="magenta", weight=3];
2112 -> 2199[label="",style="dashed", color="magenta", weight=3];
2112 -> 2200[label="",style="dashed", color="magenta", weight=3];
2113[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (primCmpInt (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2113 -> 2208[label="",style="solid", color="black", weight=3];
2114[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (compare (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2114 -> 2209[label="",style="solid", color="black", weight=3];
2192[label="primMinusNat (Succ Zero) (Succ Zero)",fontsize=16,color="black",shape="box"];2192 -> 2210[label="",style="solid", color="black", weight=3];
2168[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (primCmpInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2168 -> 2211[label="",style="solid", color="black", weight=3];
2169[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (compare (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2169 -> 2212[label="",style="solid", color="black", weight=3];
2170[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (compare (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) /= LT)",fontsize=16,color="black",shape="box"];2170 -> 2213[label="",style="solid", color="black", weight=3];
2193[label="primMinusNat (Succ (Succ Zero)) (Succ Zero)",fontsize=16,color="black",shape="box"];2193 -> 2214[label="",style="solid", color="black", weight=3];
2194[label="Pos (Succ (Succ Zero)) - Pos (Succ (Succ Zero))",fontsize=16,color="black",shape="box"];2194 -> 2215[label="",style="solid", color="black", weight=3];
2195[label="yx25",fontsize=16,color="green",shape="box"];2171[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 (not True)",fontsize=16,color="black",shape="box"];2171 -> 2216[label="",style="solid", color="black", weight=3];
2172[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 True",fontsize=16,color="black",shape="box"];2172 -> 2217[label="",style="solid", color="black", weight=3];
2361 -> 2240[label="",style="dashed", color="red", weight=0];
2361[label="primPlusNat yx2600 yx2300",fontsize=16,color="magenta"];2361 -> 2420[label="",style="dashed", color="magenta", weight=3];
2361 -> 2421[label="",style="dashed", color="magenta", weight=3];
2173[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ yx15000)) yx151 (not (primCmpNat yx15000 Zero == GT))",fontsize=16,color="burlywood",shape="box"];2812[label="yx15000/Succ yx150000",fontsize=10,color="white",style="solid",shape="box"];2173 -> 2812[label="",style="solid", color="burlywood", weight=9];
2812 -> 2218[label="",style="solid", color="burlywood", weight=3];
2813[label="yx15000/Zero",fontsize=10,color="white",style="solid",shape="box"];2173 -> 2813[label="",style="solid", color="burlywood", weight=9];
2813 -> 2219[label="",style="solid", color="burlywood", weight=3];
2174[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) yx151 (not (LT == GT))",fontsize=16,color="black",shape="box"];2174 -> 2220[label="",style="solid", color="black", weight=3];
2175[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg (Succ yx15000)) yx151 (not False)",fontsize=16,color="black",shape="box"];2175 -> 2221[label="",style="solid", color="black", weight=3];
2176[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg Zero) yx151 (not False)",fontsize=16,color="black",shape="box"];2176 -> 2222[label="",style="solid", color="black", weight=3];
2177[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ yx16000)) yx161 (not (primCmpNat yx16000 (Succ Zero) == GT))",fontsize=16,color="burlywood",shape="box"];2814[label="yx16000/Succ yx160000",fontsize=10,color="white",style="solid",shape="box"];2177 -> 2814[label="",style="solid", color="burlywood", weight=9];
2814 -> 2223[label="",style="solid", color="burlywood", weight=3];
2815[label="yx16000/Zero",fontsize=10,color="white",style="solid",shape="box"];2177 -> 2815[label="",style="solid", color="burlywood", weight=9];
2815 -> 2224[label="",style="solid", color="burlywood", weight=3];
2178[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) yx161 (not (LT == GT))",fontsize=16,color="black",shape="box"];2178 -> 2225[label="",style="solid", color="black", weight=3];
2179[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg (Succ yx16000)) yx161 (not False)",fontsize=16,color="black",shape="box"];2179 -> 2226[label="",style="solid", color="black", weight=3];
2180[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg Zero) yx161 (not False)",fontsize=16,color="black",shape="box"];2180 -> 2227[label="",style="solid", color="black", weight=3];
2182 -> 2119[label="",style="dashed", color="red", weight=0];
2182[label="primPlusInt (Pos Zero - Pos (Succ Zero)) (primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero)))",fontsize=16,color="magenta"];2182 -> 2228[label="",style="dashed", color="magenta", weight=3];
2182 -> 2229[label="",style="dashed", color="magenta", weight=3];
2183 -> 2119[label="",style="dashed", color="red", weight=0];
2183[label="primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))",fontsize=16,color="magenta"];2183 -> 2230[label="",style="dashed", color="magenta", weight=3];
2183 -> 2231[label="",style="dashed", color="magenta", weight=3];
2184 -> 2119[label="",style="dashed", color="red", weight=0];
2184[label="primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))",fontsize=16,color="magenta"];2184 -> 2232[label="",style="dashed", color="magenta", weight=3];
2184 -> 2233[label="",style="dashed", color="magenta", weight=3];
2181[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (primCmpInt yx30 (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="triangle"];2819[label="yx30/Pos yx300",fontsize=10,color="white",style="solid",shape="box"];2181 -> 2819[label="",style="solid", color="burlywood", weight=9];
2819 -> 2234[label="",style="solid", color="burlywood", weight=3];
2820[label="yx30/Neg yx300",fontsize=10,color="white",style="solid",shape="box"];2181 -> 2820[label="",style="solid", color="burlywood", weight=9];
2820 -> 2235[label="",style="solid", color="burlywood", weight=3];
2196 -> 2311[label="",style="dashed", color="red", weight=0];
2196[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))) (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ Zero)) (primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))))) (not (primCmpInt (primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))) (Pos (Succ Zero)) == LT))",fontsize=16,color="magenta"];2196 -> 2312[label="",style="dashed", color="magenta", weight=3];
2196 -> 2313[label="",style="dashed", color="magenta", weight=3];
2196 -> 2314[label="",style="dashed", color="magenta", weight=3];
2196 -> 2315[label="",style="dashed", color="magenta", weight=3];
2198 -> 2119[label="",style="dashed", color="red", weight=0];
2198[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2198 -> 2246[label="",style="dashed", color="magenta", weight=3];
2198 -> 2247[label="",style="dashed", color="magenta", weight=3];
2199 -> 2119[label="",style="dashed", color="red", weight=0];
2199[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))))",fontsize=16,color="magenta"];2199 -> 2248[label="",style="dashed", color="magenta", weight=3];
2199 -> 2249[label="",style="dashed", color="magenta", weight=3];
2200 -> 2119[label="",style="dashed", color="red", weight=0];
2200[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2200 -> 2250[label="",style="dashed", color="magenta", weight=3];
2200 -> 2251[label="",style="dashed", color="magenta", weight=3];
2197[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (primCmpInt yx34 (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="triangle"];2825[label="yx34/Pos yx340",fontsize=10,color="white",style="solid",shape="box"];2197 -> 2825[label="",style="solid", color="burlywood", weight=9];
2825 -> 2252[label="",style="solid", color="burlywood", weight=3];
2826[label="yx34/Neg yx340",fontsize=10,color="white",style="solid",shape="box"];2197 -> 2826[label="",style="solid", color="burlywood", weight=9];
2826 -> 2253[label="",style="solid", color="burlywood", weight=3];
2208 -> 2311[label="",style="dashed", color="red", weight=0];
2208[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))))) (not (primCmpInt (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) == LT))",fontsize=16,color="magenta"];2208 -> 2316[label="",style="dashed", color="magenta", weight=3];
2208 -> 2317[label="",style="dashed", color="magenta", weight=3];
2208 -> 2318[label="",style="dashed", color="magenta", weight=3];
2208 -> 2319[label="",style="dashed", color="magenta", weight=3];
2209[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos Zero - Pos (Succ (Succ Zero)) +) (Pos Zero - Pos (Succ (Succ Zero)) + (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (primCmpInt (Pos Zero - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2209 -> 2266[label="",style="solid", color="black", weight=3];
2210 -> 2203[label="",style="dashed", color="red", weight=0];
2210[label="primMinusNat Zero Zero",fontsize=16,color="magenta"];2210 -> 2267[label="",style="dashed", color="magenta", weight=3];
2210 -> 2268[label="",style="dashed", color="magenta", weight=3];
2211 -> 2269[label="",style="dashed", color="red", weight=0];
2211[label="takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))))) (not (primCmpInt (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (Pos Zero) == LT))",fontsize=16,color="magenta"];2211 -> 2270[label="",style="dashed", color="magenta", weight=3];
2211 -> 2271[label="",style="dashed", color="magenta", weight=3];
2211 -> 2272[label="",style="dashed", color="magenta", weight=3];
2212[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (primCmpInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2212 -> 2281[label="",style="solid", color="black", weight=3];
2213[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (compare (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2213 -> 2282[label="",style="solid", color="black", weight=3];
2214 -> 2203[label="",style="dashed", color="red", weight=0];
2214[label="primMinusNat (Succ Zero) Zero",fontsize=16,color="magenta"];2214 -> 2283[label="",style="dashed", color="magenta", weight=3];
2214 -> 2284[label="",style="dashed", color="magenta", weight=3];
2215[label="primMinusInt (Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];2215 -> 2285[label="",style="solid", color="black", weight=3];
2216[label="takeWhile1 (flip (<=) (Pos Zero)) yx21 yx18 False",fontsize=16,color="black",shape="box"];2216 -> 2286[label="",style="solid", color="black", weight=3];
2217[label="yx21 : takeWhile (flip (<=) (Pos Zero)) yx18",fontsize=16,color="green",shape="box"];2217 -> 2287[label="",style="dashed", color="green", weight=3];
2420[label="yx2600",fontsize=16,color="green",shape="box"];2421[label="yx2300",fontsize=16,color="green",shape="box"];2218[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ yx150000))) yx151 (not (primCmpNat (Succ yx150000) Zero == GT))",fontsize=16,color="black",shape="box"];2218 -> 2288[label="",style="solid", color="black", weight=3];
2219[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) yx151 (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];2219 -> 2289[label="",style="solid", color="black", weight=3];
2220[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) yx151 (not False)",fontsize=16,color="black",shape="box"];2220 -> 2290[label="",style="solid", color="black", weight=3];
2221[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg (Succ yx15000)) yx151 True",fontsize=16,color="black",shape="box"];2221 -> 2291[label="",style="solid", color="black", weight=3];
2222[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Neg Zero) yx151 True",fontsize=16,color="black",shape="box"];2222 -> 2292[label="",style="solid", color="black", weight=3];
2223[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ yx160000))) yx161 (not (primCmpNat (Succ yx160000) (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];2223 -> 2293[label="",style="solid", color="black", weight=3];
2224[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) yx161 (not (primCmpNat Zero (Succ Zero) == GT))",fontsize=16,color="black",shape="box"];2224 -> 2294[label="",style="solid", color="black", weight=3];
2225[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) yx161 (not False)",fontsize=16,color="black",shape="box"];2225 -> 2295[label="",style="solid", color="black", weight=3];
2226[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg (Succ yx16000)) yx161 True",fontsize=16,color="black",shape="box"];2226 -> 2296[label="",style="solid", color="black", weight=3];
2227[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Neg Zero) yx161 True",fontsize=16,color="black",shape="box"];2227 -> 2297[label="",style="solid", color="black", weight=3];
2228[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="black",shape="triangle"];2228 -> 2298[label="",style="solid", color="black", weight=3];
2229 -> 2119[label="",style="dashed", color="red", weight=0];
2229[label="primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))",fontsize=16,color="magenta"];2229 -> 2299[label="",style="dashed", color="magenta", weight=3];
2229 -> 2300[label="",style="dashed", color="magenta", weight=3];
2230 -> 2228[label="",style="dashed", color="red", weight=0];
2230[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2231[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];2232 -> 2228[label="",style="dashed", color="red", weight=0];
2232[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2233[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];2234[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (primCmpInt (Pos yx300) (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2834[label="yx300/Succ yx3000",fontsize=10,color="white",style="solid",shape="box"];2234 -> 2834[label="",style="solid", color="burlywood", weight=9];
2834 -> 2301[label="",style="solid", color="burlywood", weight=3];
2835[label="yx300/Zero",fontsize=10,color="white",style="solid",shape="box"];2234 -> 2835[label="",style="solid", color="burlywood", weight=9];
2835 -> 2302[label="",style="solid", color="burlywood", weight=3];
2235[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (primCmpInt (Neg yx300) (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2836[label="yx300/Succ yx3000",fontsize=10,color="white",style="solid",shape="box"];2235 -> 2836[label="",style="solid", color="burlywood", weight=9];
2836 -> 2303[label="",style="solid", color="burlywood", weight=3];
2837[label="yx300/Zero",fontsize=10,color="white",style="solid",shape="box"];2235 -> 2837[label="",style="solid", color="burlywood", weight=9];
2837 -> 2304[label="",style="solid", color="burlywood", weight=3];
2312 -> 2119[label="",style="dashed", color="red", weight=0];
2312[label="primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))",fontsize=16,color="magenta"];2312 -> 2335[label="",style="dashed", color="magenta", weight=3];
2312 -> 2336[label="",style="dashed", color="magenta", weight=3];
2313 -> 2119[label="",style="dashed", color="red", weight=0];
2313[label="primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))",fontsize=16,color="magenta"];2313 -> 2337[label="",style="dashed", color="magenta", weight=3];
2313 -> 2338[label="",style="dashed", color="magenta", weight=3];
2314 -> 2119[label="",style="dashed", color="red", weight=0];
2314[label="primPlusInt (Pos Zero - Pos (Succ Zero)) (primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero)))",fontsize=16,color="magenta"];2314 -> 2339[label="",style="dashed", color="magenta", weight=3];
2314 -> 2340[label="",style="dashed", color="magenta", weight=3];
2315 -> 2228[label="",style="dashed", color="red", weight=0];
2315[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2311[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpInt yx38 (Pos (Succ Zero)) == LT))",fontsize=16,color="burlywood",shape="triangle"];2842[label="yx38/Pos yx380",fontsize=10,color="white",style="solid",shape="box"];2311 -> 2842[label="",style="solid", color="burlywood", weight=9];
2842 -> 2341[label="",style="solid", color="burlywood", weight=3];
2843[label="yx38/Neg yx380",fontsize=10,color="white",style="solid",shape="box"];2311 -> 2843[label="",style="solid", color="burlywood", weight=9];
2843 -> 2342[label="",style="solid", color="burlywood", weight=3];
2246[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="black",shape="triangle"];2246 -> 2343[label="",style="solid", color="black", weight=3];
2247[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2248 -> 2246[label="",style="dashed", color="red", weight=0];
2248[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2249 -> 2119[label="",style="dashed", color="red", weight=0];
2249[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2249 -> 2344[label="",style="dashed", color="magenta", weight=3];
2249 -> 2345[label="",style="dashed", color="magenta", weight=3];
2250 -> 2246[label="",style="dashed", color="red", weight=0];
2250[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2251[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2252[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (primCmpInt (Pos yx340) (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2847[label="yx340/Succ yx3400",fontsize=10,color="white",style="solid",shape="box"];2252 -> 2847[label="",style="solid", color="burlywood", weight=9];
2847 -> 2346[label="",style="solid", color="burlywood", weight=3];
2848[label="yx340/Zero",fontsize=10,color="white",style="solid",shape="box"];2252 -> 2848[label="",style="solid", color="burlywood", weight=9];
2848 -> 2347[label="",style="solid", color="burlywood", weight=3];
2253[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (primCmpInt (Neg yx340) (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2849[label="yx340/Succ yx3400",fontsize=10,color="white",style="solid",shape="box"];2253 -> 2849[label="",style="solid", color="burlywood", weight=9];
2849 -> 2348[label="",style="solid", color="burlywood", weight=3];
2850[label="yx340/Zero",fontsize=10,color="white",style="solid",shape="box"];2253 -> 2850[label="",style="solid", color="burlywood", weight=9];
2850 -> 2349[label="",style="solid", color="burlywood", weight=3];
2316 -> 2119[label="",style="dashed", color="red", weight=0];
2316[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2316 -> 2350[label="",style="dashed", color="magenta", weight=3];
2316 -> 2351[label="",style="dashed", color="magenta", weight=3];
2317 -> 2119[label="",style="dashed", color="red", weight=0];
2317[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2317 -> 2352[label="",style="dashed", color="magenta", weight=3];
2317 -> 2353[label="",style="dashed", color="magenta", weight=3];
2318 -> 2119[label="",style="dashed", color="red", weight=0];
2318[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))))",fontsize=16,color="magenta"];2318 -> 2354[label="",style="dashed", color="magenta", weight=3];
2318 -> 2355[label="",style="dashed", color="magenta", weight=3];
2319 -> 2246[label="",style="dashed", color="red", weight=0];
2319[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2266 -> 2356[label="",style="dashed", color="red", weight=0];
2266[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))))) (not (primCmpInt (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="magenta"];2266 -> 2357[label="",style="dashed", color="magenta", weight=3];
2266 -> 2358[label="",style="dashed", color="magenta", weight=3];
2266 -> 2359[label="",style="dashed", color="magenta", weight=3];
2266 -> 2360[label="",style="dashed", color="magenta", weight=3];
2267[label="Zero",fontsize=16,color="green",shape="box"];2268[label="Zero",fontsize=16,color="green",shape="box"];2270 -> 2119[label="",style="dashed", color="red", weight=0];
2270[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))))",fontsize=16,color="magenta"];2270 -> 2362[label="",style="dashed", color="magenta", weight=3];
2270 -> 2363[label="",style="dashed", color="magenta", weight=3];
2271 -> 2119[label="",style="dashed", color="red", weight=0];
2271[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2271 -> 2364[label="",style="dashed", color="magenta", weight=3];
2271 -> 2365[label="",style="dashed", color="magenta", weight=3];
2272 -> 2119[label="",style="dashed", color="red", weight=0];
2272[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2272 -> 2366[label="",style="dashed", color="magenta", weight=3];
2272 -> 2367[label="",style="dashed", color="magenta", weight=3];
2269[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (primCmpInt yx46 (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="triangle"];2859[label="yx46/Pos yx460",fontsize=10,color="white",style="solid",shape="box"];2269 -> 2859[label="",style="solid", color="burlywood", weight=9];
2859 -> 2368[label="",style="solid", color="burlywood", weight=3];
2860[label="yx46/Neg yx460",fontsize=10,color="white",style="solid",shape="box"];2269 -> 2860[label="",style="solid", color="burlywood", weight=9];
2860 -> 2369[label="",style="solid", color="burlywood", weight=3];
2281 -> 2311[label="",style="dashed", color="red", weight=0];
2281[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))))) (not (primCmpInt (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) == LT))",fontsize=16,color="magenta"];2281 -> 2325[label="",style="dashed", color="magenta", weight=3];
2281 -> 2326[label="",style="dashed", color="magenta", weight=3];
2281 -> 2327[label="",style="dashed", color="magenta", weight=3];
2281 -> 2328[label="",style="dashed", color="magenta", weight=3];
2282[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (iterate (Pos (Succ Zero) - Pos (Succ (Succ Zero)) +) (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))))) (not (primCmpInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)) + Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2282 -> 2370[label="",style="solid", color="black", weight=3];
2283[label="Succ Zero",fontsize=16,color="green",shape="box"];2284[label="Zero",fontsize=16,color="green",shape="box"];2285 -> 2203[label="",style="dashed", color="red", weight=0];
2285[label="primMinusNat (Succ (Succ Zero)) (Succ (Succ Zero))",fontsize=16,color="magenta"];2285 -> 2371[label="",style="dashed", color="magenta", weight=3];
2285 -> 2372[label="",style="dashed", color="magenta", weight=3];
2286[label="takeWhile0 (flip (<=) (Pos Zero)) yx21 yx18 otherwise",fontsize=16,color="black",shape="box"];2286 -> 2373[label="",style="solid", color="black", weight=3];
2287[label="takeWhile (flip (<=) (Pos Zero)) yx18",fontsize=16,color="burlywood",shape="box"];2863[label="yx18/yx180 : yx181",fontsize=10,color="white",style="solid",shape="box"];2287 -> 2863[label="",style="solid", color="burlywood", weight=9];
2863 -> 2374[label="",style="solid", color="burlywood", weight=3];
2864[label="yx18/[]",fontsize=10,color="white",style="solid",shape="box"];2287 -> 2864[label="",style="solid", color="burlywood", weight=9];
2864 -> 2375[label="",style="solid", color="burlywood", weight=3];
2288[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ yx150000))) yx151 (not (GT == GT))",fontsize=16,color="black",shape="box"];2288 -> 2376[label="",style="solid", color="black", weight=3];
2289[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) yx151 (not (EQ == GT))",fontsize=16,color="black",shape="box"];2289 -> 2377[label="",style="solid", color="black", weight=3];
2290 -> 1760[label="",style="dashed", color="red", weight=0];
2290[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos Zero) yx151 True",fontsize=16,color="magenta"];2290 -> 2378[label="",style="dashed", color="magenta", weight=3];
2291[label="Neg (Succ yx15000) : takeWhile (flip (<=) (Pos (Succ Zero))) yx151",fontsize=16,color="green",shape="box"];2291 -> 2379[label="",style="dashed", color="green", weight=3];
2292[label="Neg Zero : takeWhile (flip (<=) (Pos (Succ Zero))) yx151",fontsize=16,color="green",shape="box"];2292 -> 2380[label="",style="dashed", color="green", weight=3];
2293[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ yx160000))) yx161 (not (primCmpNat yx160000 Zero == GT))",fontsize=16,color="burlywood",shape="box"];2866[label="yx160000/Succ yx1600000",fontsize=10,color="white",style="solid",shape="box"];2293 -> 2866[label="",style="solid", color="burlywood", weight=9];
2866 -> 2381[label="",style="solid", color="burlywood", weight=3];
2867[label="yx160000/Zero",fontsize=10,color="white",style="solid",shape="box"];2293 -> 2867[label="",style="solid", color="burlywood", weight=9];
2867 -> 2382[label="",style="solid", color="burlywood", weight=3];
2294[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) yx161 (not (LT == GT))",fontsize=16,color="black",shape="box"];2294 -> 2383[label="",style="solid", color="black", weight=3];
2295[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos Zero) yx161 True",fontsize=16,color="black",shape="box"];2295 -> 2384[label="",style="solid", color="black", weight=3];
2296[label="Neg (Succ yx16000) : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="green",shape="box"];2296 -> 2385[label="",style="dashed", color="green", weight=3];
2297[label="Neg Zero : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="green",shape="box"];2297 -> 2386[label="",style="dashed", color="green", weight=3];
2298[label="primMinusInt (Pos Zero) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];2298 -> 2387[label="",style="solid", color="black", weight=3];
2299 -> 2228[label="",style="dashed", color="red", weight=0];
2299[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2300[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];2301[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (primCmpInt (Pos (Succ yx3000)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2301 -> 2388[label="",style="solid", color="black", weight=3];
2302[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2302 -> 2389[label="",style="solid", color="black", weight=3];
2303[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (primCmpInt (Neg (Succ yx3000)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2303 -> 2390[label="",style="solid", color="black", weight=3];
2304[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2304 -> 2391[label="",style="solid", color="black", weight=3];
2335 -> 2228[label="",style="dashed", color="red", weight=0];
2335[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2336[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];2337 -> 2228[label="",style="dashed", color="red", weight=0];
2337[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2338[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];2339 -> 2228[label="",style="dashed", color="red", weight=0];
2339[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2340 -> 2119[label="",style="dashed", color="red", weight=0];
2340[label="primPlusInt (Pos Zero - Pos (Succ Zero)) (Pos (Succ Zero))",fontsize=16,color="magenta"];2340 -> 2392[label="",style="dashed", color="magenta", weight=3];
2340 -> 2393[label="",style="dashed", color="magenta", weight=3];
2341[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpInt (Pos yx380) (Pos (Succ Zero)) == LT))",fontsize=16,color="burlywood",shape="box"];2873[label="yx380/Succ yx3800",fontsize=10,color="white",style="solid",shape="box"];2341 -> 2873[label="",style="solid", color="burlywood", weight=9];
2873 -> 2394[label="",style="solid", color="burlywood", weight=3];
2874[label="yx380/Zero",fontsize=10,color="white",style="solid",shape="box"];2341 -> 2874[label="",style="solid", color="burlywood", weight=9];
2874 -> 2395[label="",style="solid", color="burlywood", weight=3];
2342[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpInt (Neg yx380) (Pos (Succ Zero)) == LT))",fontsize=16,color="burlywood",shape="box"];2875[label="yx380/Succ yx3800",fontsize=10,color="white",style="solid",shape="box"];2342 -> 2875[label="",style="solid", color="burlywood", weight=9];
2875 -> 2396[label="",style="solid", color="burlywood", weight=3];
2876[label="yx380/Zero",fontsize=10,color="white",style="solid",shape="box"];2342 -> 2876[label="",style="solid", color="burlywood", weight=9];
2876 -> 2397[label="",style="solid", color="burlywood", weight=3];
2343[label="primMinusInt (Pos Zero) (Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];2343 -> 2398[label="",style="solid", color="black", weight=3];
2344 -> 2246[label="",style="dashed", color="red", weight=0];
2344[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2345[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2346[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (primCmpInt (Pos (Succ yx3400)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2346 -> 2399[label="",style="solid", color="black", weight=3];
2347[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2347 -> 2400[label="",style="solid", color="black", weight=3];
2348[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (primCmpInt (Neg (Succ yx3400)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2348 -> 2401[label="",style="solid", color="black", weight=3];
2349[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2349 -> 2402[label="",style="solid", color="black", weight=3];
2350 -> 2246[label="",style="dashed", color="red", weight=0];
2350[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2351[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2352 -> 2246[label="",style="dashed", color="red", weight=0];
2352[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2353[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2354 -> 2246[label="",style="dashed", color="red", weight=0];
2354[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2355 -> 2119[label="",style="dashed", color="red", weight=0];
2355[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2355 -> 2403[label="",style="dashed", color="magenta", weight=3];
2355 -> 2404[label="",style="dashed", color="magenta", weight=3];
2357 -> 2119[label="",style="dashed", color="red", weight=0];
2357[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2357 -> 2405[label="",style="dashed", color="magenta", weight=3];
2357 -> 2406[label="",style="dashed", color="magenta", weight=3];
2358 -> 2119[label="",style="dashed", color="red", weight=0];
2358[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2358 -> 2407[label="",style="dashed", color="magenta", weight=3];
2358 -> 2408[label="",style="dashed", color="magenta", weight=3];
2359 -> 2119[label="",style="dashed", color="red", weight=0];
2359[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))))",fontsize=16,color="magenta"];2359 -> 2409[label="",style="dashed", color="magenta", weight=3];
2359 -> 2410[label="",style="dashed", color="magenta", weight=3];
2360 -> 2246[label="",style="dashed", color="red", weight=0];
2360[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2356[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpInt yx54 (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="burlywood",shape="triangle"];2886[label="yx54/Pos yx540",fontsize=10,color="white",style="solid",shape="box"];2356 -> 2886[label="",style="solid", color="burlywood", weight=9];
2886 -> 2411[label="",style="solid", color="burlywood", weight=3];
2887[label="yx54/Neg yx540",fontsize=10,color="white",style="solid",shape="box"];2356 -> 2887[label="",style="solid", color="burlywood", weight=9];
2887 -> 2412[label="",style="solid", color="burlywood", weight=3];
2362 -> 2328[label="",style="dashed", color="red", weight=0];
2362[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2363 -> 2119[label="",style="dashed", color="red", weight=0];
2363[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2363 -> 2422[label="",style="dashed", color="magenta", weight=3];
2363 -> 2423[label="",style="dashed", color="magenta", weight=3];
2364 -> 2328[label="",style="dashed", color="red", weight=0];
2364[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2365[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2366 -> 2328[label="",style="dashed", color="red", weight=0];
2366[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2367[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2368[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (primCmpInt (Pos yx460) (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2892[label="yx460/Succ yx4600",fontsize=10,color="white",style="solid",shape="box"];2368 -> 2892[label="",style="solid", color="burlywood", weight=9];
2892 -> 2424[label="",style="solid", color="burlywood", weight=3];
2893[label="yx460/Zero",fontsize=10,color="white",style="solid",shape="box"];2368 -> 2893[label="",style="solid", color="burlywood", weight=9];
2893 -> 2425[label="",style="solid", color="burlywood", weight=3];
2369[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (primCmpInt (Neg yx460) (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2894[label="yx460/Succ yx4600",fontsize=10,color="white",style="solid",shape="box"];2369 -> 2894[label="",style="solid", color="burlywood", weight=9];
2894 -> 2426[label="",style="solid", color="burlywood", weight=3];
2895[label="yx460/Zero",fontsize=10,color="white",style="solid",shape="box"];2369 -> 2895[label="",style="solid", color="burlywood", weight=9];
2895 -> 2427[label="",style="solid", color="burlywood", weight=3];
2325 -> 2119[label="",style="dashed", color="red", weight=0];
2325[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2325 -> 2413[label="",style="dashed", color="magenta", weight=3];
2325 -> 2414[label="",style="dashed", color="magenta", weight=3];
2326 -> 2119[label="",style="dashed", color="red", weight=0];
2326[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2326 -> 2415[label="",style="dashed", color="magenta", weight=3];
2326 -> 2416[label="",style="dashed", color="magenta", weight=3];
2327 -> 2119[label="",style="dashed", color="red", weight=0];
2327[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))))",fontsize=16,color="magenta"];2327 -> 2417[label="",style="dashed", color="magenta", weight=3];
2327 -> 2418[label="",style="dashed", color="magenta", weight=3];
2328[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="black",shape="triangle"];2328 -> 2419[label="",style="solid", color="black", weight=3];
2370 -> 2356[label="",style="dashed", color="red", weight=0];
2370[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))))) (not (primCmpInt (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="magenta"];2370 -> 2428[label="",style="dashed", color="magenta", weight=3];
2370 -> 2429[label="",style="dashed", color="magenta", weight=3];
2370 -> 2430[label="",style="dashed", color="magenta", weight=3];
2370 -> 2431[label="",style="dashed", color="magenta", weight=3];
2371[label="Succ (Succ Zero)",fontsize=16,color="green",shape="box"];2372[label="Succ (Succ Zero)",fontsize=16,color="green",shape="box"];2373[label="takeWhile0 (flip (<=) (Pos Zero)) yx21 yx18 True",fontsize=16,color="black",shape="box"];2373 -> 2432[label="",style="solid", color="black", weight=3];
2374[label="takeWhile (flip (<=) (Pos Zero)) (yx180 : yx181)",fontsize=16,color="black",shape="box"];2374 -> 2433[label="",style="solid", color="black", weight=3];
2375[label="takeWhile (flip (<=) (Pos Zero)) []",fontsize=16,color="black",shape="box"];2375 -> 2434[label="",style="solid", color="black", weight=3];
2376[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ yx150000))) yx151 (not True)",fontsize=16,color="black",shape="box"];2376 -> 2435[label="",style="solid", color="black", weight=3];
2377[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) yx151 (not False)",fontsize=16,color="black",shape="box"];2377 -> 2436[label="",style="solid", color="black", weight=3];
2378[label="yx151",fontsize=16,color="green",shape="box"];2379 -> 1778[label="",style="dashed", color="red", weight=0];
2379[label="takeWhile (flip (<=) (Pos (Succ Zero))) yx151",fontsize=16,color="magenta"];2379 -> 2437[label="",style="dashed", color="magenta", weight=3];
2380 -> 1778[label="",style="dashed", color="red", weight=0];
2380[label="takeWhile (flip (<=) (Pos (Succ Zero))) yx151",fontsize=16,color="magenta"];2380 -> 2438[label="",style="dashed", color="magenta", weight=3];
2381[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ (Succ yx1600000)))) yx161 (not (primCmpNat (Succ yx1600000) Zero == GT))",fontsize=16,color="black",shape="box"];2381 -> 2439[label="",style="solid", color="black", weight=3];
2382[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) yx161 (not (primCmpNat Zero Zero == GT))",fontsize=16,color="black",shape="box"];2382 -> 2440[label="",style="solid", color="black", weight=3];
2383[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) yx161 (not False)",fontsize=16,color="black",shape="box"];2383 -> 2441[label="",style="solid", color="black", weight=3];
2384[label="Pos Zero : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="green",shape="box"];2384 -> 2442[label="",style="dashed", color="green", weight=3];
2385 -> 1774[label="",style="dashed", color="red", weight=0];
2385[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="magenta"];2385 -> 2443[label="",style="dashed", color="magenta", weight=3];
2386 -> 1774[label="",style="dashed", color="red", weight=0];
2386[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="magenta"];2386 -> 2444[label="",style="dashed", color="magenta", weight=3];
2387 -> 2203[label="",style="dashed", color="red", weight=0];
2387[label="primMinusNat Zero (Succ Zero)",fontsize=16,color="magenta"];2387 -> 2445[label="",style="dashed", color="magenta", weight=3];
2387 -> 2446[label="",style="dashed", color="magenta", weight=3];
2388 -> 2447[label="",style="dashed", color="red", weight=0];
2388[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (primCmpNat (Succ yx3000) Zero == LT))",fontsize=16,color="magenta"];2388 -> 2448[label="",style="dashed", color="magenta", weight=3];
2389 -> 2453[label="",style="dashed", color="red", weight=0];
2389[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (EQ == LT))",fontsize=16,color="magenta"];2389 -> 2454[label="",style="dashed", color="magenta", weight=3];
2390 -> 2462[label="",style="dashed", color="red", weight=0];
2390[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (LT == LT))",fontsize=16,color="magenta"];2390 -> 2463[label="",style="dashed", color="magenta", weight=3];
2391 -> 2453[label="",style="dashed", color="red", weight=0];
2391[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt (Pos Zero - Pos (Succ Zero))) yx28) (not (EQ == LT))",fontsize=16,color="magenta"];2391 -> 2455[label="",style="dashed", color="magenta", weight=3];
2392 -> 2228[label="",style="dashed", color="red", weight=0];
2392[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2393[label="Pos (Succ Zero)",fontsize=16,color="green",shape="box"];2394[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpInt (Pos (Succ yx3800)) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2394 -> 2467[label="",style="solid", color="black", weight=3];
2395[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpInt (Pos Zero) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2395 -> 2468[label="",style="solid", color="black", weight=3];
2396[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpInt (Neg (Succ yx3800)) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2396 -> 2469[label="",style="solid", color="black", weight=3];
2397[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpInt (Neg Zero) (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2397 -> 2470[label="",style="solid", color="black", weight=3];
2398 -> 2203[label="",style="dashed", color="red", weight=0];
2398[label="primMinusNat Zero (Succ (Succ Zero))",fontsize=16,color="magenta"];2398 -> 2471[label="",style="dashed", color="magenta", weight=3];
2398 -> 2472[label="",style="dashed", color="magenta", weight=3];
2399 -> 2447[label="",style="dashed", color="red", weight=0];
2399[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (primCmpNat (Succ yx3400) Zero == LT))",fontsize=16,color="magenta"];2399 -> 2449[label="",style="dashed", color="magenta", weight=3];
2399 -> 2450[label="",style="dashed", color="magenta", weight=3];
2399 -> 2451[label="",style="dashed", color="magenta", weight=3];
2399 -> 2452[label="",style="dashed", color="magenta", weight=3];
2400 -> 2453[label="",style="dashed", color="red", weight=0];
2400[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (EQ == LT))",fontsize=16,color="magenta"];2400 -> 2456[label="",style="dashed", color="magenta", weight=3];
2400 -> 2457[label="",style="dashed", color="magenta", weight=3];
2400 -> 2458[label="",style="dashed", color="magenta", weight=3];
2401 -> 2462[label="",style="dashed", color="red", weight=0];
2401[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (LT == LT))",fontsize=16,color="magenta"];2401 -> 2464[label="",style="dashed", color="magenta", weight=3];
2401 -> 2465[label="",style="dashed", color="magenta", weight=3];
2401 -> 2466[label="",style="dashed", color="magenta", weight=3];
2402 -> 2453[label="",style="dashed", color="red", weight=0];
2402[label="takeWhile1 (flip (>=) (Pos Zero)) yx31 (iterate (primPlusInt (Pos Zero - Pos (Succ (Succ Zero)))) yx32) (not (EQ == LT))",fontsize=16,color="magenta"];2402 -> 2459[label="",style="dashed", color="magenta", weight=3];
2402 -> 2460[label="",style="dashed", color="magenta", weight=3];
2402 -> 2461[label="",style="dashed", color="magenta", weight=3];
2403 -> 2246[label="",style="dashed", color="red", weight=0];
2403[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2404[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2405 -> 2246[label="",style="dashed", color="red", weight=0];
2405[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2406[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2407 -> 2246[label="",style="dashed", color="red", weight=0];
2407[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2408[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2409 -> 2246[label="",style="dashed", color="red", weight=0];
2409[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2410 -> 2119[label="",style="dashed", color="red", weight=0];
2410[label="primPlusInt (Pos Zero - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2410 -> 2473[label="",style="dashed", color="magenta", weight=3];
2410 -> 2474[label="",style="dashed", color="magenta", weight=3];
2411[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpInt (Pos yx540) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="burlywood",shape="box"];2920[label="yx540/Succ yx5400",fontsize=10,color="white",style="solid",shape="box"];2411 -> 2920[label="",style="solid", color="burlywood", weight=9];
2920 -> 2475[label="",style="solid", color="burlywood", weight=3];
2921[label="yx540/Zero",fontsize=10,color="white",style="solid",shape="box"];2411 -> 2921[label="",style="solid", color="burlywood", weight=9];
2921 -> 2476[label="",style="solid", color="burlywood", weight=3];
2412[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpInt (Neg yx540) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="burlywood",shape="box"];2922[label="yx540/Succ yx5400",fontsize=10,color="white",style="solid",shape="box"];2412 -> 2922[label="",style="solid", color="burlywood", weight=9];
2922 -> 2477[label="",style="solid", color="burlywood", weight=3];
2923[label="yx540/Zero",fontsize=10,color="white",style="solid",shape="box"];2412 -> 2923[label="",style="solid", color="burlywood", weight=9];
2923 -> 2478[label="",style="solid", color="burlywood", weight=3];
2422 -> 2328[label="",style="dashed", color="red", weight=0];
2422[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2423[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2424[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (primCmpInt (Pos (Succ yx4600)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2424 -> 2479[label="",style="solid", color="black", weight=3];
2425[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2425 -> 2480[label="",style="solid", color="black", weight=3];
2426[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (primCmpInt (Neg (Succ yx4600)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2426 -> 2481[label="",style="solid", color="black", weight=3];
2427[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2427 -> 2482[label="",style="solid", color="black", weight=3];
2413 -> 2328[label="",style="dashed", color="red", weight=0];
2413[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2414[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2415 -> 2328[label="",style="dashed", color="red", weight=0];
2415[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2416[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2417 -> 2328[label="",style="dashed", color="red", weight=0];
2417[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2418 -> 2119[label="",style="dashed", color="red", weight=0];
2418[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2418 -> 2483[label="",style="dashed", color="magenta", weight=3];
2418 -> 2484[label="",style="dashed", color="magenta", weight=3];
2419[label="primMinusInt (Pos (Succ Zero)) (Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];2419 -> 2485[label="",style="solid", color="black", weight=3];
2428 -> 2119[label="",style="dashed", color="red", weight=0];
2428[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2428 -> 2486[label="",style="dashed", color="magenta", weight=3];
2428 -> 2487[label="",style="dashed", color="magenta", weight=3];
2429 -> 2119[label="",style="dashed", color="red", weight=0];
2429[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2429 -> 2488[label="",style="dashed", color="magenta", weight=3];
2429 -> 2489[label="",style="dashed", color="magenta", weight=3];
2430 -> 2119[label="",style="dashed", color="red", weight=0];
2430[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero))))",fontsize=16,color="magenta"];2430 -> 2490[label="",style="dashed", color="magenta", weight=3];
2430 -> 2491[label="",style="dashed", color="magenta", weight=3];
2431 -> 2328[label="",style="dashed", color="red", weight=0];
2431[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2432[label="[]",fontsize=16,color="green",shape="box"];2433[label="takeWhile2 (flip (<=) (Pos Zero)) (yx180 : yx181)",fontsize=16,color="black",shape="box"];2433 -> 2492[label="",style="solid", color="black", weight=3];
2434[label="takeWhile3 (flip (<=) (Pos Zero)) []",fontsize=16,color="black",shape="box"];2434 -> 2493[label="",style="solid", color="black", weight=3];
2435[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ yx150000))) yx151 False",fontsize=16,color="black",shape="box"];2435 -> 2494[label="",style="solid", color="black", weight=3];
2436[label="takeWhile1 (flip (<=) (Pos (Succ Zero))) (Pos (Succ Zero)) yx151 True",fontsize=16,color="black",shape="box"];2436 -> 2495[label="",style="solid", color="black", weight=3];
2437[label="yx151",fontsize=16,color="green",shape="box"];2438[label="yx151",fontsize=16,color="green",shape="box"];2439[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ (Succ yx1600000)))) yx161 (not (GT == GT))",fontsize=16,color="black",shape="box"];2439 -> 2496[label="",style="solid", color="black", weight=3];
2440[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) yx161 (not (EQ == GT))",fontsize=16,color="black",shape="box"];2440 -> 2497[label="",style="solid", color="black", weight=3];
2441[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ Zero)) yx161 True",fontsize=16,color="black",shape="box"];2441 -> 2498[label="",style="solid", color="black", weight=3];
2442 -> 1774[label="",style="dashed", color="red", weight=0];
2442[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="magenta"];2442 -> 2499[label="",style="dashed", color="magenta", weight=3];
2443[label="yx161",fontsize=16,color="green",shape="box"];2444[label="yx161",fontsize=16,color="green",shape="box"];2445[label="Zero",fontsize=16,color="green",shape="box"];2446[label="Succ Zero",fontsize=16,color="green",shape="box"];2448 -> 2228[label="",style="dashed", color="red", weight=0];
2448[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2447[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx57) yx28) (not (primCmpNat (Succ yx3000) Zero == LT))",fontsize=16,color="black",shape="triangle"];2447 -> 2500[label="",style="solid", color="black", weight=3];
2454 -> 2228[label="",style="dashed", color="red", weight=0];
2454[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2453[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx58) yx28) (not (EQ == LT))",fontsize=16,color="black",shape="triangle"];2453 -> 2501[label="",style="solid", color="black", weight=3];
2463 -> 2228[label="",style="dashed", color="red", weight=0];
2463[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2462[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx59) yx28) (not (LT == LT))",fontsize=16,color="black",shape="triangle"];2462 -> 2502[label="",style="solid", color="black", weight=3];
2455 -> 2228[label="",style="dashed", color="red", weight=0];
2455[label="Pos Zero - Pos (Succ Zero)",fontsize=16,color="magenta"];2467[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpNat (Succ yx3800) (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];2467 -> 2503[label="",style="solid", color="black", weight=3];
2468[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpNat Zero (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];2468 -> 2504[label="",style="solid", color="black", weight=3];
2469[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (LT == LT))",fontsize=16,color="black",shape="triangle"];2469 -> 2505[label="",style="solid", color="black", weight=3];
2470 -> 2469[label="",style="dashed", color="red", weight=0];
2470[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (LT == LT))",fontsize=16,color="magenta"];2471[label="Zero",fontsize=16,color="green",shape="box"];2472[label="Succ (Succ Zero)",fontsize=16,color="green",shape="box"];2449[label="yx32",fontsize=16,color="green",shape="box"];2450 -> 2246[label="",style="dashed", color="red", weight=0];
2450[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2451[label="yx3400",fontsize=16,color="green",shape="box"];2452[label="yx31",fontsize=16,color="green",shape="box"];2456[label="yx32",fontsize=16,color="green",shape="box"];2457 -> 2246[label="",style="dashed", color="red", weight=0];
2457[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2458[label="yx31",fontsize=16,color="green",shape="box"];2464[label="yx32",fontsize=16,color="green",shape="box"];2465[label="yx31",fontsize=16,color="green",shape="box"];2466 -> 2246[label="",style="dashed", color="red", weight=0];
2466[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2459[label="yx32",fontsize=16,color="green",shape="box"];2460 -> 2246[label="",style="dashed", color="red", weight=0];
2460[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2461[label="yx31",fontsize=16,color="green",shape="box"];2473 -> 2246[label="",style="dashed", color="red", weight=0];
2473[label="Pos Zero - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2474[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2475[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpInt (Pos (Succ yx5400)) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2475 -> 2506[label="",style="solid", color="black", weight=3];
2476[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpInt (Pos Zero) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2476 -> 2507[label="",style="solid", color="black", weight=3];
2477[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpInt (Neg (Succ yx5400)) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2477 -> 2508[label="",style="solid", color="black", weight=3];
2478[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpInt (Neg Zero) (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2478 -> 2509[label="",style="solid", color="black", weight=3];
2479 -> 2447[label="",style="dashed", color="red", weight=0];
2479[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (primCmpNat (Succ yx4600) Zero == LT))",fontsize=16,color="magenta"];2479 -> 2510[label="",style="dashed", color="magenta", weight=3];
2479 -> 2511[label="",style="dashed", color="magenta", weight=3];
2479 -> 2512[label="",style="dashed", color="magenta", weight=3];
2479 -> 2513[label="",style="dashed", color="magenta", weight=3];
2480 -> 2453[label="",style="dashed", color="red", weight=0];
2480[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (EQ == LT))",fontsize=16,color="magenta"];2480 -> 2514[label="",style="dashed", color="magenta", weight=3];
2480 -> 2515[label="",style="dashed", color="magenta", weight=3];
2480 -> 2516[label="",style="dashed", color="magenta", weight=3];
2481 -> 2462[label="",style="dashed", color="red", weight=0];
2481[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (LT == LT))",fontsize=16,color="magenta"];2481 -> 2517[label="",style="dashed", color="magenta", weight=3];
2481 -> 2518[label="",style="dashed", color="magenta", weight=3];
2481 -> 2519[label="",style="dashed", color="magenta", weight=3];
2482 -> 2453[label="",style="dashed", color="red", weight=0];
2482[label="takeWhile1 (flip (>=) (Pos Zero)) yx43 (iterate (primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero)))) yx44) (not (EQ == LT))",fontsize=16,color="magenta"];2482 -> 2520[label="",style="dashed", color="magenta", weight=3];
2482 -> 2521[label="",style="dashed", color="magenta", weight=3];
2482 -> 2522[label="",style="dashed", color="magenta", weight=3];
2483 -> 2328[label="",style="dashed", color="red", weight=0];
2483[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2484[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2485 -> 2203[label="",style="dashed", color="red", weight=0];
2485[label="primMinusNat (Succ Zero) (Succ (Succ Zero))",fontsize=16,color="magenta"];2485 -> 2523[label="",style="dashed", color="magenta", weight=3];
2485 -> 2524[label="",style="dashed", color="magenta", weight=3];
2486 -> 2328[label="",style="dashed", color="red", weight=0];
2486[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2487[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2488 -> 2328[label="",style="dashed", color="red", weight=0];
2488[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2489[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2490 -> 2328[label="",style="dashed", color="red", weight=0];
2490[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2491 -> 2119[label="",style="dashed", color="red", weight=0];
2491[label="primPlusInt (Pos (Succ Zero) - Pos (Succ (Succ Zero))) (Pos (Succ (Succ Zero)))",fontsize=16,color="magenta"];2491 -> 2525[label="",style="dashed", color="magenta", weight=3];
2491 -> 2526[label="",style="dashed", color="magenta", weight=3];
2492 -> 1885[label="",style="dashed", color="red", weight=0];
2492[label="takeWhile1 (flip (<=) (Pos Zero)) yx180 yx181 (flip (<=) (Pos Zero) yx180)",fontsize=16,color="magenta"];2492 -> 2527[label="",style="dashed", color="magenta", weight=3];
2492 -> 2528[label="",style="dashed", color="magenta", weight=3];
2492 -> 2529[label="",style="dashed", color="magenta", weight=3];
2493[label="[]",fontsize=16,color="green",shape="box"];2494[label="takeWhile0 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ yx150000))) yx151 otherwise",fontsize=16,color="black",shape="box"];2494 -> 2530[label="",style="solid", color="black", weight=3];
2495[label="Pos (Succ Zero) : takeWhile (flip (<=) (Pos (Succ Zero))) yx151",fontsize=16,color="green",shape="box"];2495 -> 2531[label="",style="dashed", color="green", weight=3];
2496[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ (Succ yx1600000)))) yx161 (not True)",fontsize=16,color="black",shape="box"];2496 -> 2532[label="",style="solid", color="black", weight=3];
2497[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) yx161 (not False)",fontsize=16,color="black",shape="box"];2497 -> 2533[label="",style="solid", color="black", weight=3];
2498[label="Pos (Succ Zero) : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="green",shape="box"];2498 -> 2534[label="",style="dashed", color="green", weight=3];
2499[label="yx161",fontsize=16,color="green",shape="box"];2500[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx57) yx28) (not (GT == LT))",fontsize=16,color="black",shape="box"];2500 -> 2535[label="",style="solid", color="black", weight=3];
2501[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx58) yx28) (not False)",fontsize=16,color="black",shape="triangle"];2501 -> 2536[label="",style="solid", color="black", weight=3];
2502[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx59) yx28) (not True)",fontsize=16,color="black",shape="box"];2502 -> 2537[label="",style="solid", color="black", weight=3];
2503[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpNat yx3800 Zero == LT))",fontsize=16,color="burlywood",shape="box"];2955[label="yx3800/Succ yx38000",fontsize=10,color="white",style="solid",shape="box"];2503 -> 2955[label="",style="solid", color="burlywood", weight=9];
2955 -> 2538[label="",style="solid", color="burlywood", weight=3];
2956[label="yx3800/Zero",fontsize=10,color="white",style="solid",shape="box"];2503 -> 2956[label="",style="solid", color="burlywood", weight=9];
2956 -> 2539[label="",style="solid", color="burlywood", weight=3];
2504 -> 2469[label="",style="dashed", color="red", weight=0];
2504[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (LT == LT))",fontsize=16,color="magenta"];2505[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not True)",fontsize=16,color="black",shape="box"];2505 -> 2540[label="",style="solid", color="black", weight=3];
2506[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpNat (Succ yx5400) (Succ (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2506 -> 2541[label="",style="solid", color="black", weight=3];
2507[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpNat Zero (Succ (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2507 -> 2542[label="",style="solid", color="black", weight=3];
2508[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (LT == LT))",fontsize=16,color="black",shape="triangle"];2508 -> 2543[label="",style="solid", color="black", weight=3];
2509 -> 2508[label="",style="dashed", color="red", weight=0];
2509[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (LT == LT))",fontsize=16,color="magenta"];2510[label="yx44",fontsize=16,color="green",shape="box"];2511 -> 2328[label="",style="dashed", color="red", weight=0];
2511[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2512[label="yx4600",fontsize=16,color="green",shape="box"];2513[label="yx43",fontsize=16,color="green",shape="box"];2514[label="yx44",fontsize=16,color="green",shape="box"];2515 -> 2328[label="",style="dashed", color="red", weight=0];
2515[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2516[label="yx43",fontsize=16,color="green",shape="box"];2517[label="yx44",fontsize=16,color="green",shape="box"];2518[label="yx43",fontsize=16,color="green",shape="box"];2519 -> 2328[label="",style="dashed", color="red", weight=0];
2519[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2520[label="yx44",fontsize=16,color="green",shape="box"];2521 -> 2328[label="",style="dashed", color="red", weight=0];
2521[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2522[label="yx43",fontsize=16,color="green",shape="box"];2523[label="Succ Zero",fontsize=16,color="green",shape="box"];2524[label="Succ (Succ Zero)",fontsize=16,color="green",shape="box"];2525 -> 2328[label="",style="dashed", color="red", weight=0];
2525[label="Pos (Succ Zero) - Pos (Succ (Succ Zero))",fontsize=16,color="magenta"];2526[label="Pos (Succ (Succ Zero))",fontsize=16,color="green",shape="box"];2527[label="yx181",fontsize=16,color="green",shape="box"];2528[label="yx180",fontsize=16,color="green",shape="box"];2529[label="yx180",fontsize=16,color="green",shape="box"];2530[label="takeWhile0 (flip (<=) (Pos (Succ Zero))) (Pos (Succ (Succ yx150000))) yx151 True",fontsize=16,color="black",shape="box"];2530 -> 2544[label="",style="solid", color="black", weight=3];
2531 -> 1778[label="",style="dashed", color="red", weight=0];
2531[label="takeWhile (flip (<=) (Pos (Succ Zero))) yx151",fontsize=16,color="magenta"];2531 -> 2545[label="",style="dashed", color="magenta", weight=3];
2532[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ (Succ yx1600000)))) yx161 False",fontsize=16,color="black",shape="box"];2532 -> 2546[label="",style="solid", color="black", weight=3];
2533[label="takeWhile1 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ Zero))) yx161 True",fontsize=16,color="black",shape="box"];2533 -> 2547[label="",style="solid", color="black", weight=3];
2534 -> 1774[label="",style="dashed", color="red", weight=0];
2534[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="magenta"];2534 -> 2548[label="",style="dashed", color="magenta", weight=3];
2535 -> 2501[label="",style="dashed", color="red", weight=0];
2535[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx57) yx28) (not False)",fontsize=16,color="magenta"];2535 -> 2549[label="",style="dashed", color="magenta", weight=3];
2536[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx58) yx28) True",fontsize=16,color="black",shape="box"];2536 -> 2550[label="",style="solid", color="black", weight=3];
2537[label="takeWhile1 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx59) yx28) False",fontsize=16,color="black",shape="box"];2537 -> 2551[label="",style="solid", color="black", weight=3];
2538[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpNat (Succ yx38000) Zero == LT))",fontsize=16,color="black",shape="box"];2538 -> 2552[label="",style="solid", color="black", weight=3];
2539[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (primCmpNat Zero Zero == LT))",fontsize=16,color="black",shape="box"];2539 -> 2553[label="",style="solid", color="black", weight=3];
2540[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) False",fontsize=16,color="black",shape="box"];2540 -> 2554[label="",style="solid", color="black", weight=3];
2541[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpNat yx5400 (Succ Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2967[label="yx5400/Succ yx54000",fontsize=10,color="white",style="solid",shape="box"];2541 -> 2967[label="",style="solid", color="burlywood", weight=9];
2967 -> 2555[label="",style="solid", color="burlywood", weight=3];
2968[label="yx5400/Zero",fontsize=10,color="white",style="solid",shape="box"];2541 -> 2968[label="",style="solid", color="burlywood", weight=9];
2968 -> 2556[label="",style="solid", color="burlywood", weight=3];
2542 -> 2508[label="",style="dashed", color="red", weight=0];
2542[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (LT == LT))",fontsize=16,color="magenta"];2543[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not True)",fontsize=16,color="black",shape="box"];2543 -> 2557[label="",style="solid", color="black", weight=3];
2544[label="[]",fontsize=16,color="green",shape="box"];2545[label="yx151",fontsize=16,color="green",shape="box"];2546[label="takeWhile0 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ (Succ yx1600000)))) yx161 otherwise",fontsize=16,color="black",shape="box"];2546 -> 2558[label="",style="solid", color="black", weight=3];
2547[label="Pos (Succ (Succ Zero)) : takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="green",shape="box"];2547 -> 2559[label="",style="dashed", color="green", weight=3];
2548[label="yx161",fontsize=16,color="green",shape="box"];2549[label="yx57",fontsize=16,color="green",shape="box"];2550[label="yx27 : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt yx58) yx28)",fontsize=16,color="green",shape="box"];2550 -> 2560[label="",style="dashed", color="green", weight=3];
2551[label="takeWhile0 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx59) yx28) otherwise",fontsize=16,color="black",shape="box"];2551 -> 2561[label="",style="solid", color="black", weight=3];
2552[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (GT == LT))",fontsize=16,color="black",shape="box"];2552 -> 2562[label="",style="solid", color="black", weight=3];
2553[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not (EQ == LT))",fontsize=16,color="black",shape="box"];2553 -> 2563[label="",style="solid", color="black", weight=3];
2554[label="takeWhile0 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) otherwise",fontsize=16,color="black",shape="box"];2554 -> 2564[label="",style="solid", color="black", weight=3];
2555[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpNat (Succ yx54000) (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];2555 -> 2565[label="",style="solid", color="black", weight=3];
2556[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpNat Zero (Succ Zero) == LT))",fontsize=16,color="black",shape="box"];2556 -> 2566[label="",style="solid", color="black", weight=3];
2557[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) False",fontsize=16,color="black",shape="box"];2557 -> 2567[label="",style="solid", color="black", weight=3];
2558[label="takeWhile0 (flip (<=) (Pos (Succ (Succ Zero)))) (Pos (Succ (Succ (Succ yx1600000)))) yx161 True",fontsize=16,color="black",shape="box"];2558 -> 2568[label="",style="solid", color="black", weight=3];
2559 -> 1774[label="",style="dashed", color="red", weight=0];
2559[label="takeWhile (flip (<=) (Pos (Succ (Succ Zero)))) yx161",fontsize=16,color="magenta"];2559 -> 2569[label="",style="dashed", color="magenta", weight=3];
2560[label="takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt yx58) yx28)",fontsize=16,color="black",shape="box"];2560 -> 2570[label="",style="solid", color="black", weight=3];
2561[label="takeWhile0 (flip (>=) (Pos Zero)) yx27 (iterate (primPlusInt yx59) yx28) True",fontsize=16,color="black",shape="box"];2561 -> 2571[label="",style="solid", color="black", weight=3];
2562[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not False)",fontsize=16,color="black",shape="triangle"];2562 -> 2572[label="",style="solid", color="black", weight=3];
2563 -> 2562[label="",style="dashed", color="red", weight=0];
2563[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) (not False)",fontsize=16,color="magenta"];2564[label="takeWhile0 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) True",fontsize=16,color="black",shape="box"];2564 -> 2573[label="",style="solid", color="black", weight=3];
2565[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpNat yx54000 Zero == LT))",fontsize=16,color="burlywood",shape="box"];2972[label="yx54000/Succ yx540000",fontsize=10,color="white",style="solid",shape="box"];2565 -> 2972[label="",style="solid", color="burlywood", weight=9];
2972 -> 2574[label="",style="solid", color="burlywood", weight=3];
2973[label="yx54000/Zero",fontsize=10,color="white",style="solid",shape="box"];2565 -> 2973[label="",style="solid", color="burlywood", weight=9];
2973 -> 2575[label="",style="solid", color="burlywood", weight=3];
2566 -> 2508[label="",style="dashed", color="red", weight=0];
2566[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (LT == LT))",fontsize=16,color="magenta"];2567[label="takeWhile0 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) otherwise",fontsize=16,color="black",shape="box"];2567 -> 2576[label="",style="solid", color="black", weight=3];
2568[label="[]",fontsize=16,color="green",shape="box"];2569[label="yx161",fontsize=16,color="green",shape="box"];2570 -> 2577[label="",style="dashed", color="red", weight=0];
2570[label="takeWhile (flip (>=) (Pos Zero)) (yx28 : iterate (primPlusInt yx58) (primPlusInt yx58 yx28))",fontsize=16,color="magenta"];2570 -> 2578[label="",style="dashed", color="magenta", weight=3];
2571[label="[]",fontsize=16,color="green",shape="box"];2572[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx35 (iterate (primPlusInt yx47) yx36) True",fontsize=16,color="black",shape="box"];2572 -> 2579[label="",style="solid", color="black", weight=3];
2573[label="[]",fontsize=16,color="green",shape="box"];2574[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpNat (Succ yx540000) Zero == LT))",fontsize=16,color="black",shape="box"];2574 -> 2580[label="",style="solid", color="black", weight=3];
2575[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (primCmpNat Zero Zero == LT))",fontsize=16,color="black",shape="box"];2575 -> 2581[label="",style="solid", color="black", weight=3];
2576[label="takeWhile0 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) True",fontsize=16,color="black",shape="box"];2576 -> 2582[label="",style="solid", color="black", weight=3];
2578 -> 2119[label="",style="dashed", color="red", weight=0];
2578[label="primPlusInt yx58 yx28",fontsize=16,color="magenta"];2578 -> 2583[label="",style="dashed", color="magenta", weight=3];
2578 -> 2584[label="",style="dashed", color="magenta", weight=3];
2577[label="takeWhile (flip (>=) (Pos Zero)) (yx28 : iterate (primPlusInt yx58) yx60)",fontsize=16,color="black",shape="triangle"];2577 -> 2585[label="",style="solid", color="black", weight=3];
2579[label="yx35 : takeWhile (flip (>=) (Pos (Succ Zero))) (iterate (primPlusInt yx47) yx36)",fontsize=16,color="green",shape="box"];2579 -> 2586[label="",style="dashed", color="green", weight=3];
2580[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (GT == LT))",fontsize=16,color="black",shape="box"];2580 -> 2587[label="",style="solid", color="black", weight=3];
2581[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not (EQ == LT))",fontsize=16,color="black",shape="box"];2581 -> 2588[label="",style="solid", color="black", weight=3];
2582[label="[]",fontsize=16,color="green",shape="box"];2583[label="yx58",fontsize=16,color="green",shape="box"];2584[label="yx28",fontsize=16,color="green",shape="box"];2585[label="takeWhile2 (flip (>=) (Pos Zero)) (yx28 : iterate (primPlusInt yx58) yx60)",fontsize=16,color="black",shape="box"];2585 -> 2589[label="",style="solid", color="black", weight=3];
2586[label="takeWhile (flip (>=) (Pos (Succ Zero))) (iterate (primPlusInt yx47) yx36)",fontsize=16,color="black",shape="box"];2586 -> 2590[label="",style="solid", color="black", weight=3];
2587[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not False)",fontsize=16,color="black",shape="triangle"];2587 -> 2591[label="",style="solid", color="black", weight=3];
2588 -> 2587[label="",style="dashed", color="red", weight=0];
2588[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) (not False)",fontsize=16,color="magenta"];2589[label="takeWhile1 (flip (>=) (Pos Zero)) yx28 (iterate (primPlusInt yx58) yx60) (flip (>=) (Pos Zero) yx28)",fontsize=16,color="black",shape="box"];2589 -> 2592[label="",style="solid", color="black", weight=3];
2590 -> 2593[label="",style="dashed", color="red", weight=0];
2590[label="takeWhile (flip (>=) (Pos (Succ Zero))) (yx36 : iterate (primPlusInt yx47) (primPlusInt yx47 yx36))",fontsize=16,color="magenta"];2590 -> 2594[label="",style="dashed", color="magenta", weight=3];
2591[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx48 (iterate (primPlusInt yx53) yx49) True",fontsize=16,color="black",shape="box"];2591 -> 2595[label="",style="solid", color="black", weight=3];
2592[label="takeWhile1 (flip (>=) (Pos Zero)) yx28 (iterate (primPlusInt yx58) yx60) ((>=) yx28 Pos Zero)",fontsize=16,color="black",shape="box"];2592 -> 2596[label="",style="solid", color="black", weight=3];
2594 -> 2119[label="",style="dashed", color="red", weight=0];
2594[label="primPlusInt yx47 yx36",fontsize=16,color="magenta"];2594 -> 2597[label="",style="dashed", color="magenta", weight=3];
2594 -> 2598[label="",style="dashed", color="magenta", weight=3];
2593[label="takeWhile (flip (>=) (Pos (Succ Zero))) (yx36 : iterate (primPlusInt yx47) yx61)",fontsize=16,color="black",shape="triangle"];2593 -> 2599[label="",style="solid", color="black", weight=3];
2595[label="yx48 : takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (iterate (primPlusInt yx53) yx49)",fontsize=16,color="green",shape="box"];2595 -> 2600[label="",style="dashed", color="green", weight=3];
2596[label="takeWhile1 (flip (>=) (Pos Zero)) yx28 (iterate (primPlusInt yx58) yx60) (compare yx28 (Pos Zero) /= LT)",fontsize=16,color="black",shape="box"];2596 -> 2601[label="",style="solid", color="black", weight=3];
2597[label="yx47",fontsize=16,color="green",shape="box"];2598[label="yx36",fontsize=16,color="green",shape="box"];2599[label="takeWhile2 (flip (>=) (Pos (Succ Zero))) (yx36 : iterate (primPlusInt yx47) yx61)",fontsize=16,color="black",shape="box"];2599 -> 2602[label="",style="solid", color="black", weight=3];
2600[label="takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (iterate (primPlusInt yx53) yx49)",fontsize=16,color="black",shape="box"];2600 -> 2603[label="",style="solid", color="black", weight=3];
2601[label="takeWhile1 (flip (>=) (Pos Zero)) yx28 (iterate (primPlusInt yx58) yx60) (not (compare yx28 (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2601 -> 2604[label="",style="solid", color="black", weight=3];
2602[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx36 (iterate (primPlusInt yx47) yx61) (flip (>=) (Pos (Succ Zero)) yx36)",fontsize=16,color="black",shape="box"];2602 -> 2605[label="",style="solid", color="black", weight=3];
2603 -> 2606[label="",style="dashed", color="red", weight=0];
2603[label="takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (yx49 : iterate (primPlusInt yx53) (primPlusInt yx53 yx49))",fontsize=16,color="magenta"];2603 -> 2607[label="",style="dashed", color="magenta", weight=3];
2604[label="takeWhile1 (flip (>=) (Pos Zero)) yx28 (iterate (primPlusInt yx58) yx60) (not (primCmpInt yx28 (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2981[label="yx28/Pos yx280",fontsize=10,color="white",style="solid",shape="box"];2604 -> 2981[label="",style="solid", color="burlywood", weight=9];
2981 -> 2608[label="",style="solid", color="burlywood", weight=3];
2982[label="yx28/Neg yx280",fontsize=10,color="white",style="solid",shape="box"];2604 -> 2982[label="",style="solid", color="burlywood", weight=9];
2982 -> 2609[label="",style="solid", color="burlywood", weight=3];
2605[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx36 (iterate (primPlusInt yx47) yx61) ((>=) yx36 Pos (Succ Zero))",fontsize=16,color="black",shape="box"];2605 -> 2610[label="",style="solid", color="black", weight=3];
2607 -> 2119[label="",style="dashed", color="red", weight=0];
2607[label="primPlusInt yx53 yx49",fontsize=16,color="magenta"];2607 -> 2611[label="",style="dashed", color="magenta", weight=3];
2607 -> 2612[label="",style="dashed", color="magenta", weight=3];
2606[label="takeWhile (flip (>=) (Pos (Succ (Succ Zero)))) (yx49 : iterate (primPlusInt yx53) yx62)",fontsize=16,color="black",shape="triangle"];2606 -> 2613[label="",style="solid", color="black", weight=3];
2608[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos yx280) (iterate (primPlusInt yx58) yx60) (not (primCmpInt (Pos yx280) (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2984[label="yx280/Succ yx2800",fontsize=10,color="white",style="solid",shape="box"];2608 -> 2984[label="",style="solid", color="burlywood", weight=9];
2984 -> 2614[label="",style="solid", color="burlywood", weight=3];
2985[label="yx280/Zero",fontsize=10,color="white",style="solid",shape="box"];2608 -> 2985[label="",style="solid", color="burlywood", weight=9];
2985 -> 2615[label="",style="solid", color="burlywood", weight=3];
2609[label="takeWhile1 (flip (>=) (Pos Zero)) (Neg yx280) (iterate (primPlusInt yx58) yx60) (not (primCmpInt (Neg yx280) (Pos Zero) == LT))",fontsize=16,color="burlywood",shape="box"];2986[label="yx280/Succ yx2800",fontsize=10,color="white",style="solid",shape="box"];2609 -> 2986[label="",style="solid", color="burlywood", weight=9];
2986 -> 2616[label="",style="solid", color="burlywood", weight=3];
2987[label="yx280/Zero",fontsize=10,color="white",style="solid",shape="box"];2609 -> 2987[label="",style="solid", color="burlywood", weight=9];
2987 -> 2617[label="",style="solid", color="burlywood", weight=3];
2610[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx36 (iterate (primPlusInt yx47) yx61) (compare yx36 (Pos (Succ Zero)) /= LT)",fontsize=16,color="black",shape="box"];2610 -> 2618[label="",style="solid", color="black", weight=3];
2611[label="yx53",fontsize=16,color="green",shape="box"];2612[label="yx49",fontsize=16,color="green",shape="box"];2613[label="takeWhile2 (flip (>=) (Pos (Succ (Succ Zero)))) (yx49 : iterate (primPlusInt yx53) yx62)",fontsize=16,color="black",shape="box"];2613 -> 2619[label="",style="solid", color="black", weight=3];
2614[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ yx2800)) (iterate (primPlusInt yx58) yx60) (not (primCmpInt (Pos (Succ yx2800)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2614 -> 2620[label="",style="solid", color="black", weight=3];
2615[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt yx58) yx60) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2615 -> 2621[label="",style="solid", color="black", weight=3];
2616[label="takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ yx2800)) (iterate (primPlusInt yx58) yx60) (not (primCmpInt (Neg (Succ yx2800)) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2616 -> 2622[label="",style="solid", color="black", weight=3];
2617[label="takeWhile1 (flip (>=) (Pos Zero)) (Neg Zero) (iterate (primPlusInt yx58) yx60) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))",fontsize=16,color="black",shape="box"];2617 -> 2623[label="",style="solid", color="black", weight=3];
2618[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx36 (iterate (primPlusInt yx47) yx61) (not (compare yx36 (Pos (Succ Zero)) == LT))",fontsize=16,color="black",shape="box"];2618 -> 2624[label="",style="solid", color="black", weight=3];
2619[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx49 (iterate (primPlusInt yx53) yx62) (flip (>=) (Pos (Succ (Succ Zero))) yx49)",fontsize=16,color="black",shape="box"];2619 -> 2625[label="",style="solid", color="black", weight=3];
2620 -> 2447[label="",style="dashed", color="red", weight=0];
2620[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ yx2800)) (iterate (primPlusInt yx58) yx60) (not (primCmpNat (Succ yx2800) Zero == LT))",fontsize=16,color="magenta"];2620 -> 2626[label="",style="dashed", color="magenta", weight=3];
2620 -> 2627[label="",style="dashed", color="magenta", weight=3];
2620 -> 2628[label="",style="dashed", color="magenta", weight=3];
2620 -> 2629[label="",style="dashed", color="magenta", weight=3];
2621 -> 2453[label="",style="dashed", color="red", weight=0];
2621[label="takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt yx58) yx60) (not (EQ == LT))",fontsize=16,color="magenta"];2621 -> 2630[label="",style="dashed", color="magenta", weight=3];
2621 -> 2631[label="",style="dashed", color="magenta", weight=3];
2622 -> 2462[label="",style="dashed", color="red", weight=0];
2622[label="takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ yx2800)) (iterate (primPlusInt yx58) yx60) (not (LT == LT))",fontsize=16,color="magenta"];2622 -> 2632[label="",style="dashed", color="magenta", weight=3];
2622 -> 2633[label="",style="dashed", color="magenta", weight=3];
2622 -> 2634[label="",style="dashed", color="magenta", weight=3];
2623 -> 2453[label="",style="dashed", color="red", weight=0];
2623[label="takeWhile1 (flip (>=) (Pos Zero)) (Neg Zero) (iterate (primPlusInt yx58) yx60) (not (EQ == LT))",fontsize=16,color="magenta"];2623 -> 2635[label="",style="dashed", color="magenta", weight=3];
2623 -> 2636[label="",style="dashed", color="magenta", weight=3];
2624 -> 2311[label="",style="dashed", color="red", weight=0];
2624[label="takeWhile1 (flip (>=) (Pos (Succ Zero))) yx36 (iterate (primPlusInt yx47) yx61) (not (primCmpInt yx36 (Pos (Succ Zero)) == LT))",fontsize=16,color="magenta"];2624 -> 2637[label="",style="dashed", color="magenta", weight=3];
2624 -> 2638[label="",style="dashed", color="magenta", weight=3];
2624 -> 2639[label="",style="dashed", color="magenta", weight=3];
2625[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx49 (iterate (primPlusInt yx53) yx62) ((>=) yx49 Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];2625 -> 2640[label="",style="solid", color="black", weight=3];
2626[label="yx60",fontsize=16,color="green",shape="box"];2627[label="yx58",fontsize=16,color="green",shape="box"];2628[label="yx2800",fontsize=16,color="green",shape="box"];2629[label="Pos (Succ yx2800)",fontsize=16,color="green",shape="box"];2630[label="yx60",fontsize=16,color="green",shape="box"];2631[label="Pos Zero",fontsize=16,color="green",shape="box"];2632[label="yx60",fontsize=16,color="green",shape="box"];2633[label="Neg (Succ yx2800)",fontsize=16,color="green",shape="box"];2634[label="yx58",fontsize=16,color="green",shape="box"];2635[label="yx60",fontsize=16,color="green",shape="box"];2636[label="Neg Zero",fontsize=16,color="green",shape="box"];2637[label="yx36",fontsize=16,color="green",shape="box"];2638[label="yx36",fontsize=16,color="green",shape="box"];2639[label="yx61",fontsize=16,color="green",shape="box"];2640[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx49 (iterate (primPlusInt yx53) yx62) (compare yx49 (Pos (Succ (Succ Zero))) /= LT)",fontsize=16,color="black",shape="box"];2640 -> 2641[label="",style="solid", color="black", weight=3];
2641[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx49 (iterate (primPlusInt yx53) yx62) (not (compare yx49 (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="black",shape="box"];2641 -> 2642[label="",style="solid", color="black", weight=3];
2642 -> 2356[label="",style="dashed", color="red", weight=0];
2642[label="takeWhile1 (flip (>=) (Pos (Succ (Succ Zero)))) yx49 (iterate (primPlusInt yx53) yx62) (not (primCmpInt yx49 (Pos (Succ (Succ Zero))) == LT))",fontsize=16,color="magenta"];2642 -> 2643[label="",style="dashed", color="magenta", weight=3];
2642 -> 2644[label="",style="dashed", color="magenta", weight=3];
2642 -> 2645[label="",style="dashed", color="magenta", weight=3];
2643[label="yx49",fontsize=16,color="green",shape="box"];2644[label="yx49",fontsize=16,color="green",shape="box"];2645[label="yx62",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                        ↳ QDPSizeChangeProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile(:(Neg(Zero), yx161)) → new_takeWhile(yx161)
new_takeWhile(:(Pos(Zero), yx161)) → new_takeWhile(yx161)
new_takeWhile(:(Pos(Succ(Succ(Zero))), yx161)) → new_takeWhile(yx161)
new_takeWhile(:(Pos(Succ(Zero)), yx161)) → new_takeWhile(yx161)
new_takeWhile(:(Neg(Succ(yx16000)), yx161)) → new_takeWhile(yx161)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_takeWhile(:(Neg(Zero), yx161)) → new_takeWhile(yx161)
The graph contains the following edges 1 > 1
new_takeWhile(:(Pos(Zero), yx161)) → new_takeWhile(yx161)
The graph contains the following edges 1 > 1
new_takeWhile(:(Pos(Succ(Succ(Zero))), yx161)) → new_takeWhile(yx161)
The graph contains the following edges 1 > 1
new_takeWhile(:(Pos(Succ(Zero)), yx161)) → new_takeWhile(yx161)
The graph contains the following edges 1 > 1
new_takeWhile(:(Neg(Succ(yx16000)), yx161)) → new_takeWhile(yx161)
The graph contains the following edges 1 > 1

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPSizeChangeProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile1(:(Pos(Zero), yx151)) → new_takeWhile1(yx151)
new_takeWhile0(:(Pos(Zero), yx151)) → new_takeWhile1(yx151)
new_takeWhile1(:(Pos(Succ(Zero)), yx151)) → new_takeWhile0(yx151)
new_takeWhile0(:(Neg(Succ(yx15000)), yx151)) → new_takeWhile0(yx151)
new_takeWhile1(:(Neg(Zero), yx151)) → new_takeWhile0(yx151)
new_takeWhile0(:(Neg(Zero), yx151)) → new_takeWhile0(yx151)
new_takeWhile0(:(Pos(Succ(Zero)), yx151)) → new_takeWhile0(yx151)
new_takeWhile1(:(Neg(Succ(yx15000)), yx151)) → new_takeWhile0(yx151)

From the DPs we obtained the following set of size-change graphs:

new_takeWhile1(:(Pos(Zero), yx151)) → new_takeWhile1(yx151)
The graph contains the following edges 1 > 1
new_takeWhile0(:(Pos(Zero), yx151)) → new_takeWhile1(yx151)
The graph contains the following edges 1 > 1
new_takeWhile1(:(Pos(Succ(Zero)), yx151)) → new_takeWhile0(yx151)
The graph contains the following edges 1 > 1
new_takeWhile1(:(Neg(Zero), yx151)) → new_takeWhile0(yx151)
The graph contains the following edges 1 > 1
new_takeWhile1(:(Neg(Succ(yx15000)), yx151)) → new_takeWhile0(yx151)
The graph contains the following edges 1 > 1
new_takeWhile0(:(Neg(Succ(yx15000)), yx151)) → new_takeWhile0(yx151)
The graph contains the following edges 1 > 1
new_takeWhile0(:(Neg(Zero), yx151)) → new_takeWhile0(yx151)
The graph contains the following edges 1 > 1
new_takeWhile0(:(Pos(Succ(Zero)), yx151)) → new_takeWhile0(yx151)
The graph contains the following edges 1 > 1

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPSizeChangeProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMinusNat(Succ(yx2600), Succ(yx2300)) → new_primMinusNat(yx2600, yx2300)

From the DPs we obtained the following set of size-change graphs:

new_primMinusNat(Succ(yx2600), Succ(yx2300)) → new_primMinusNat(yx2600, yx2300)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPSizeChangeProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primPlusNat(Succ(yx2600), Succ(yx2300)) → new_primPlusNat(yx2600, yx2300)

From the DPs we obtained the following set of size-change graphs:

new_primPlusNat(Succ(yx2600), Succ(yx2300)) → new_primPlusNat(yx2600, yx2300)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_ps(yx25))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_ps(yx25) → new_primPlusInt(new_primMinusNat0(Succ(Succ(Zero)), Succ(Succ(Zero))), yx25)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate(yx25) → new_iterate(new_ps(yx25)) at position [0] we obtained the following new rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Succ(Succ(Zero)), Succ(Succ(Zero))), yx25))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Succ(Succ(Zero)), Succ(Succ(Zero))), yx25))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_ps(yx25) → new_primPlusInt(new_primMinusNat0(Succ(Succ(Zero)), Succ(Succ(Zero))), yx25)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Succ(Succ(Zero)), Succ(Succ(Zero))), yx25))

The TRS R consists of the following rules:

new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps(x0)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Succ(Succ(Zero)), Succ(Succ(Zero))), yx25))

The TRS R consists of the following rules:

new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Succ(Succ(Zero)), Succ(Succ(Zero))), yx25)) at position [0,0] we obtained the following new rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Succ(Zero), Succ(Zero)), yx25))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Succ(Zero), Succ(Zero)), yx25))

The TRS R consists of the following rules:

new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Succ(Zero), Succ(Zero)), yx25)) at position [0,0] we obtained the following new rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Zero, Zero), yx25))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Zero, Zero), yx25))

The TRS R consists of the following rules:

new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate(yx25) → new_iterate(new_primPlusInt(new_primMinusNat0(Zero, Zero), yx25)) at position [0,0] we obtained the following new rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(Pos(Zero), yx25))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(Pos(Zero), yx25))

The TRS R consists of the following rules:

new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(Pos(Zero), yx25))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.

Strictly oriented rules of the TRS R:

new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = x₁
POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_iterate(x₁)) = x₁
POL(new_primMinusNat0(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = 2·x₁ + x₂

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ RuleRemovalProof

                                                      ↳ QDP

                                                        ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(Pos(Zero), yx25))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primMinusNat0(Zero, Zero) → Pos(Zero)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = 1 + x₁
POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = x₁
POL(Zero) = 0
POL(new_iterate(x₁)) = 2·x₁
POL(new_primMinusNat0(x₁, x₂)) = 1 + x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = x₁ + x₂

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ RuleRemovalProof

                                                      ↳ QDP

                                                        ↳ RuleRemovalProof

                                                          ↳ QDP

                                                            ↳ NonTerminationProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(Pos(Zero), yx25))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_iterate(yx25) → new_iterate(new_primPlusInt(Pos(Zero), yx25))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

s = new_iterate(yx25) evaluates to t =new_iterate(new_primPlusInt(Pos(Zero), yx25))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [yx25 / new_primPlusInt(Pos(Zero), yx25)]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_iterate(yx25) to new_iterate(new_primPlusInt(Pos(Zero), yx25)).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate0(yx24) → new_iterate0(new_ps0(yx24))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_ps0(yx24) → new_primPlusInt(new_primMinusNat0(Succ(Zero), Zero), yx24)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_ps0(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate0(yx24) → new_iterate0(new_ps0(yx24)) at position [0] we obtained the following new rules:

new_iterate0(yx24) → new_iterate0(new_primPlusInt(new_primMinusNat0(Succ(Zero), Zero), yx24))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate0(yx24) → new_iterate0(new_primPlusInt(new_primMinusNat0(Succ(Zero), Zero), yx24))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_ps0(yx24) → new_primPlusInt(new_primMinusNat0(Succ(Zero), Zero), yx24)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_ps0(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate0(yx24) → new_iterate0(new_primPlusInt(new_primMinusNat0(Succ(Zero), Zero), yx24))

The TRS R consists of the following rules:

new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_ps0(x0)
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps0(x0)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate0(yx24) → new_iterate0(new_primPlusInt(new_primMinusNat0(Succ(Zero), Zero), yx24))

The TRS R consists of the following rules:

new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate0(yx24) → new_iterate0(new_primPlusInt(new_primMinusNat0(Succ(Zero), Zero), yx24)) at position [0,0] we obtained the following new rules:

new_iterate0(yx24) → new_iterate0(new_primPlusInt(Pos(Succ(Zero)), yx24))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate0(yx24) → new_iterate0(new_primPlusInt(Pos(Succ(Zero)), yx24))

The TRS R consists of the following rules:

new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ UsableRulesProof

                                          ↳ QDP

                                            ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate0(yx24) → new_iterate0(new_primPlusInt(Pos(Succ(Zero)), yx24))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Zero) → Pos(Zero)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = 1 + x₁
POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = x₁
POL(Zero) = 0
POL(new_iterate0(x₁)) = x₁
POL(new_primMinusNat0(x₁, x₂)) = 1 + 2·x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = x₁ + x₂

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Rewriting

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ UsableRulesProof

                                          ↳ QDP

                                            ↳ RuleRemovalProof

                                              ↳ QDP

                                                ↳ NonTerminationProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate0(yx24) → new_iterate0(new_primPlusInt(Pos(Succ(Zero)), yx24))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_iterate0(yx24) → new_iterate0(new_primPlusInt(Pos(Succ(Zero)), yx24))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

s = new_iterate0(yx24) evaluates to t =new_iterate0(new_primPlusInt(Pos(Succ(Zero)), yx24))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [yx24 / new_primPlusInt(Pos(Succ(Zero)), yx24)]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_iterate0(yx24) to new_iterate0(new_primPlusInt(Pos(Succ(Zero)), yx24)).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate1(yx20) → new_iterate1(new_ps1(yx20))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_ms → Pos(Succ(Succ(Zero)))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_ps1(yx20) → new_primPlusInt(new_ms, yx20)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_ps1(x0)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_ms
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = 2 + x₁
POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = x₁
POL(Zero) = 0
POL(new_iterate1(x₁)) = 2·x₁
POL(new_ms) = 0
POL(new_primMinusNat0(x₁, x₂)) = 2 + x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = x₁ + x₂
POL(new_ps1(x₁)) = x₁

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate1(yx20) → new_iterate1(new_ps1(yx20))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_ms → Pos(Succ(Succ(Zero)))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_ps1(yx20) → new_primPlusInt(new_ms, yx20)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_ps1(x0)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_ms
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate1(yx20) → new_iterate1(new_ps1(yx20)) at position [0] we obtained the following new rules:

new_iterate1(yx20) → new_iterate1(new_primPlusInt(new_ms, yx20))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate1(yx20) → new_iterate1(new_primPlusInt(new_ms, yx20))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_ms → Pos(Succ(Succ(Zero)))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_ps1(yx20) → new_primPlusInt(new_ms, yx20)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_ps1(x0)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_ms
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ QReductionProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate1(yx20) → new_iterate1(new_primPlusInt(new_ms, yx20))

The TRS R consists of the following rules:

new_ms → Pos(Succ(Succ(Zero)))
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_ps1(x0)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_ms
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps1(x0)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ QReductionProof

                                      ↳ QDP

                                        ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate1(yx20) → new_iterate1(new_primPlusInt(new_ms, yx20))

The TRS R consists of the following rules:

new_ms → Pos(Succ(Succ(Zero)))
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_ms
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate1(yx20) → new_iterate1(new_primPlusInt(new_ms, yx20)) at position [0,0] we obtained the following new rules:

new_iterate1(yx20) → new_iterate1(new_primPlusInt(Pos(Succ(Succ(Zero))), yx20))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ QReductionProof

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate1(yx20) → new_iterate1(new_primPlusInt(Pos(Succ(Succ(Zero))), yx20))

The TRS R consists of the following rules:

new_ms → Pos(Succ(Succ(Zero)))
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_ms
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ QReductionProof

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ UsableRulesProof

                                              ↳ QDP

                                                ↳ QReductionProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate1(yx20) → new_iterate1(new_primPlusInt(Pos(Succ(Succ(Zero))), yx20))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_ms
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ms

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ UsableRulesProof

                                  ↳ QDP

                                    ↳ QReductionProof

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ UsableRulesProof

                                              ↳ QDP

                                                ↳ QReductionProof

                                                  ↳ QDP

                                                    ↳ NonTerminationProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate1(yx20) → new_iterate1(new_primPlusInt(Pos(Succ(Succ(Zero))), yx20))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_iterate1(yx20) → new_iterate1(new_primPlusInt(Pos(Succ(Succ(Zero))), yx20))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

s = new_iterate1(yx20) evaluates to t =new_iterate1(new_primPlusInt(Pos(Succ(Succ(Zero))), yx20))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [yx20 / new_primPlusInt(Pos(Succ(Succ(Zero))), yx20)]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_iterate1(yx20) to new_iterate1(new_primPlusInt(Pos(Succ(Succ(Zero))), yx20)).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_ps2(yx23))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_ps2(yx23) → new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_ps2(x0)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = x₁
POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = 2 + x₁
POL(Zero) = 0
POL(new_iterate2(x₁)) = x₁
POL(new_primMinusNat0(x₁, x₂)) = x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = x₁ + x₂
POL(new_ps2(x₁)) = x₁

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_ps2(yx23))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_ps2(yx23) → new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_ps2(x0)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = x₁
POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_iterate2(x₁)) = 2·x₁
POL(new_primMinusNat0(x₁, x₂)) = x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = 2·x₁ + x₂
POL(new_ps2(x₁)) = x₁

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_ps2(yx23))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_ps2(yx23) → new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_ps2(x0)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate2(yx23) → new_iterate2(new_ps2(yx23)) at position [0] we obtained the following new rules:

new_iterate2(yx23) → new_iterate2(new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_ps2(yx23) → new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_ps2(x0)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QReductionProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23))

The TRS R consists of the following rules:

new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_ps2(x0)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps2(x0)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QReductionProof

                                          ↳ QDP

                                            ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23))

The TRS R consists of the following rules:

new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate2(yx23) → new_iterate2(new_primPlusInt(new_primMinusNat0(Zero, Zero), yx23)) at position [0,0] we obtained the following new rules:

new_iterate2(yx23) → new_iterate2(new_primPlusInt(Pos(Zero), yx23))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QReductionProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_primPlusInt(Pos(Zero), yx23))

The TRS R consists of the following rules:

new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QReductionProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_primPlusInt(Pos(Zero), yx23))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = 1 + 2·x₁
POL(Pos(x₁)) = 2·x₁
POL(Succ(x₁)) = x₁
POL(Zero) = 0
POL(new_iterate2(x₁)) = x₁
POL(new_primMinusNat0(x₁, x₂)) = 1 + 2·x₁ + 2·x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = x₁ + x₂

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ RuleRemovalProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QReductionProof

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ UsableRulesProof

                                                  ↳ QDP

                                                    ↳ RuleRemovalProof

                                                      ↳ QDP

                                                        ↳ NonTerminationProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate2(yx23) → new_iterate2(new_primPlusInt(Pos(Zero), yx23))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_iterate2(yx23) → new_iterate2(new_primPlusInt(Pos(Zero), yx23))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

s = new_iterate2(yx23) evaluates to t =new_iterate2(new_primPlusInt(Pos(Zero), yx23))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [yx23 / new_primPlusInt(Pos(Zero), yx23)]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_iterate2(yx23) to new_iterate2(new_primPlusInt(Pos(Zero), yx23)).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate3(yx19) → new_iterate3(new_ps3(yx19))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_ps3(yx19) → new_primPlusInt(Pos(Succ(Zero)), yx19)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_ps3(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate3(yx19) → new_iterate3(new_ps3(yx19))

The TRS R consists of the following rules:

new_ps3(yx19) → new_primPlusInt(Pos(Succ(Zero)), yx19)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_ps3(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = 1 + x₁
POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = x₁
POL(Zero) = 0
POL(new_iterate3(x₁)) = 2·x₁
POL(new_primMinusNat0(x₁, x₂)) = 1 + x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = x₁ + x₂
POL(new_ps3(x₁)) = x₁

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate3(yx19) → new_iterate3(new_ps3(yx19))

The TRS R consists of the following rules:

new_ps3(yx19) → new_primPlusInt(Pos(Succ(Zero)), yx19)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_ps3(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate3(yx19) → new_iterate3(new_ps3(yx19)) at position [0] we obtained the following new rules:

new_iterate3(yx19) → new_iterate3(new_primPlusInt(Pos(Succ(Zero)), yx19))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate3(yx19) → new_iterate3(new_primPlusInt(Pos(Succ(Zero)), yx19))

The TRS R consists of the following rules:

new_ps3(yx19) → new_primPlusInt(Pos(Succ(Zero)), yx19)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_ps3(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QReductionProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate3(yx19) → new_iterate3(new_primPlusInt(Pos(Succ(Zero)), yx19))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_ps3(x0)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps3(x0)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ UsableRulesProof

                                      ↳ QDP

                                        ↳ QReductionProof

                                          ↳ QDP

                                            ↳ NonTerminationProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate3(yx19) → new_iterate3(new_primPlusInt(Pos(Succ(Zero)), yx19))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_iterate3(yx19) → new_iterate3(new_primPlusInt(Pos(Succ(Zero)), yx19))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

s = new_iterate3(yx19) evaluates to t =new_iterate3(new_primPlusInt(Pos(Succ(Zero)), yx19))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [yx19 / new_primPlusInt(Pos(Succ(Zero)), yx19)]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_iterate3(yx19) to new_iterate3(new_primPlusInt(Pos(Succ(Zero)), yx19)).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile10(yx48, yx53, yx49, Pos(Succ(Succ(Zero)))) → new_takeWhile11(yx48, yx53, yx49)
new_takeWhile10(yx48, yx53, yx49, Pos(Succ(Succ(Succ(yx540000))))) → new_takeWhile2(yx49, yx53, new_primPlusInt(yx53, yx49))
new_takeWhile11(yx48, yx53, yx49) → new_takeWhile2(yx49, yx53, new_primPlusInt(yx53, yx49))
new_takeWhile2(yx49, yx53, yx62) → new_takeWhile10(yx49, yx53, yx62, yx49)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile10(yx48, yx53, yx49, Pos(Succ(Succ(Zero)))) → new_takeWhile11(yx48, yx53, yx49) we obtained the following new rules:

new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile10(yx48, yx53, yx49, Pos(Succ(Succ(Succ(yx540000))))) → new_takeWhile2(yx49, yx53, new_primPlusInt(yx53, yx49))
new_takeWhile11(yx48, yx53, yx49) → new_takeWhile2(yx49, yx53, new_primPlusInt(yx53, yx49))
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)
new_takeWhile2(yx49, yx53, yx62) → new_takeWhile10(yx49, yx53, yx62, yx49)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile10(yx48, yx53, yx49, Pos(Succ(Succ(Succ(yx540000))))) → new_takeWhile2(yx49, yx53, new_primPlusInt(yx53, yx49)) we obtained the following new rules:

new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3))))) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3))))) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile11(yx48, yx53, yx49) → new_takeWhile2(yx49, yx53, new_primPlusInt(yx53, yx49))
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)
new_takeWhile2(yx49, yx53, yx62) → new_takeWhile10(yx49, yx53, yx62, yx49)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile11(yx48, yx53, yx49) → new_takeWhile2(yx49, yx53, new_primPlusInt(yx53, yx49)) we obtained the following new rules:

new_takeWhile11(Pos(Succ(Succ(Zero))), z0, z1) → new_takeWhile2(z1, z0, new_primPlusInt(z0, z1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3))))) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile11(Pos(Succ(Succ(Zero))), z0, z1) → new_takeWhile2(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)
new_takeWhile2(yx49, yx53, yx62) → new_takeWhile10(yx49, yx53, yx62, yx49)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
In the following pairs the term without variables Pos(Succ(Succ(Zero))) is replaced by the fresh variable x_removed.
Pair: new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)
Positions in right side of the pair:

The new variable was added to all pairs as a new argument[13].

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                      ↳ QDP

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3)))), x_removed) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2), x_removed)
new_takeWhile11(Pos(Succ(Succ(Zero))), z0, z1, x_removed) → new_takeWhile2(z1, z0, new_primPlusInt(z0, z1), x_removed)
new_takeWhile2(yx49, yx53, yx62, x_removed) → new_takeWhile10(yx49, yx53, yx62, yx49, x_removed)
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero))), x_removed) → new_takeWhile11(x_removed, z1, z2, x_removed)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

The new variable was added to all pairs as a new argument[13].

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                      ↳ QDP

                                    ↳ ForwardInstantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3)))), x_removed) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2), x_removed)
new_takeWhile11(Pos(Succ(Succ(Zero))), z0, z1, x_removed) → new_takeWhile2(z1, z0, new_primPlusInt(z0, z1), x_removed)
new_takeWhile2(yx49, yx53, yx62, x_removed) → new_takeWhile10(yx49, yx53, yx62, yx49, x_removed)
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero))), x_removed) → new_takeWhile11(x_removed, z1, z2, x_removed)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile2(yx49, yx53, yx62) → new_takeWhile10(yx49, yx53, yx62, yx49) we obtained the following new rules:

new_takeWhile2(Pos(Succ(Succ(Zero))), x1, x2) → new_takeWhile10(Pos(Succ(Succ(Zero))), x1, x2, Pos(Succ(Succ(Zero))))
new_takeWhile2(Pos(Succ(Succ(Succ(y_0)))), x1, x2) → new_takeWhile10(Pos(Succ(Succ(Succ(y_0)))), x1, x2, Pos(Succ(Succ(Succ(y_0)))))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                                      ↳ QDP

                                        ↳ RemovalProof

                                        ↳ RemovalProof

                                        ↳ MNOCProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile2(Pos(Succ(Succ(Zero))), x1, x2) → new_takeWhile10(Pos(Succ(Succ(Zero))), x1, x2, Pos(Succ(Succ(Zero))))
new_takeWhile2(Pos(Succ(Succ(Succ(y_0)))), x1, x2) → new_takeWhile10(Pos(Succ(Succ(Succ(y_0)))), x1, x2, Pos(Succ(Succ(Succ(y_0)))))
new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3))))) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile11(Pos(Succ(Succ(Zero))), z0, z1) → new_takeWhile2(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
In the following pairs the term without variables Pos(Succ(Succ(Zero))) is replaced by the fresh variable x_removed.
Pair: new_takeWhile2(Pos(Succ(Succ(Zero))), x1, x2) → new_takeWhile10(Pos(Succ(Succ(Zero))), x1, x2, Pos(Succ(Succ(Zero))))
Positions in right side of the pair:

Pair: new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)
Positions in right side of the pair:

The new variable was added to all pairs as a new argument[13].

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                                      ↳ QDP

                                        ↳ RemovalProof

                                          ↳ QDP

                                        ↳ RemovalProof

                                        ↳ MNOCProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile2(Pos(Succ(Succ(Zero))), x1, x2, x_removed) → new_takeWhile10(x_removed, x1, x2, x_removed, x_removed)
new_takeWhile2(Pos(Succ(Succ(Succ(y_0)))), x1, x2, x_removed) → new_takeWhile10(Pos(Succ(Succ(Succ(y_0)))), x1, x2, Pos(Succ(Succ(Succ(y_0)))), x_removed)
new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3)))), x_removed) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2), x_removed)
new_takeWhile11(Pos(Succ(Succ(Zero))), z0, z1, x_removed) → new_takeWhile2(z1, z0, new_primPlusInt(z0, z1), x_removed)
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero))), x_removed) → new_takeWhile11(x_removed, z1, z2, x_removed)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
In the following pairs the term without variables Pos(Succ(Succ(Zero))) is replaced by the fresh variable x_removed.
Pair: new_takeWhile2(Pos(Succ(Succ(Zero))), x1, x2) → new_takeWhile10(Pos(Succ(Succ(Zero))), x1, x2, Pos(Succ(Succ(Zero))))
Positions in right side of the pair:

Pair: new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)
Positions in right side of the pair:

The new variable was added to all pairs as a new argument[13].

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                                      ↳ QDP

                                        ↳ RemovalProof

                                        ↳ RemovalProof

                                          ↳ QDP

                                        ↳ MNOCProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile2(Pos(Succ(Succ(Zero))), x1, x2, x_removed) → new_takeWhile10(x_removed, x1, x2, x_removed, x_removed)
new_takeWhile2(Pos(Succ(Succ(Succ(y_0)))), x1, x2, x_removed) → new_takeWhile10(Pos(Succ(Succ(Succ(y_0)))), x1, x2, Pos(Succ(Succ(Succ(y_0)))), x_removed)
new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3)))), x_removed) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2), x_removed)
new_takeWhile11(Pos(Succ(Succ(Zero))), z0, z1, x_removed) → new_takeWhile2(z1, z0, new_primPlusInt(z0, z1), x_removed)
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero))), x_removed) → new_takeWhile11(x_removed, z1, z2, x_removed)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                                      ↳ QDP

                                        ↳ RemovalProof

                                        ↳ RemovalProof

                                        ↳ MNOCProof

                                          ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile2(Pos(Succ(Succ(Zero))), x1, x2) → new_takeWhile10(Pos(Succ(Succ(Zero))), x1, x2, Pos(Succ(Succ(Zero))))
new_takeWhile2(Pos(Succ(Succ(Succ(y_0)))), x1, x2) → new_takeWhile10(Pos(Succ(Succ(Succ(y_0)))), x1, x2, Pos(Succ(Succ(Succ(y_0)))))
new_takeWhile10(Pos(Succ(Succ(Succ(x3)))), z1, z2, Pos(Succ(Succ(Succ(x3))))) → new_takeWhile2(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile11(Pos(Succ(Succ(Zero))), z0, z1) → new_takeWhile2(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile10(Pos(Succ(Succ(Zero))), z1, z2, Pos(Succ(Succ(Zero)))) → new_takeWhile11(Pos(Succ(Succ(Zero))), z1, z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

Q is empty.
We have to consider all (P,Q,R)-chains.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(yx35, yx47, yx36) → new_takeWhile3(yx36, yx47, new_primPlusInt(yx47, yx36))
new_takeWhile12(yx35, yx47, yx36, Pos(Succ(Succ(yx38000)))) → new_takeWhile3(yx36, yx47, new_primPlusInt(yx47, yx36))
new_takeWhile12(yx35, yx47, yx36, Pos(Succ(Zero))) → new_takeWhile13(yx35, yx47, yx36)
new_takeWhile3(yx36, yx47, yx61) → new_takeWhile12(yx36, yx47, yx61, yx36)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile12(yx35, yx47, yx36, Pos(Succ(Succ(yx38000)))) → new_takeWhile3(yx36, yx47, new_primPlusInt(yx47, yx36)) we obtained the following new rules:

new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3)))) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(yx35, yx47, yx36) → new_takeWhile3(yx36, yx47, new_primPlusInt(yx47, yx36))
new_takeWhile12(yx35, yx47, yx36, Pos(Succ(Zero))) → new_takeWhile13(yx35, yx47, yx36)
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3)))) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile3(yx36, yx47, yx61) → new_takeWhile12(yx36, yx47, yx61, yx36)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile12(yx35, yx47, yx36, Pos(Succ(Zero))) → new_takeWhile13(yx35, yx47, yx36) we obtained the following new rules:

new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero))) → new_takeWhile13(Pos(Succ(Zero)), z1, z2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero))) → new_takeWhile13(Pos(Succ(Zero)), z1, z2)
new_takeWhile13(yx35, yx47, yx36) → new_takeWhile3(yx36, yx47, new_primPlusInt(yx47, yx36))
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3)))) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile3(yx36, yx47, yx61) → new_takeWhile12(yx36, yx47, yx61, yx36)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile13(yx35, yx47, yx36) → new_takeWhile3(yx36, yx47, new_primPlusInt(yx47, yx36)) we obtained the following new rules:

new_takeWhile13(Pos(Succ(Zero)), z0, z1) → new_takeWhile3(z1, z0, new_primPlusInt(z0, z1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero))) → new_takeWhile13(Pos(Succ(Zero)), z1, z2)
new_takeWhile13(Pos(Succ(Zero)), z0, z1) → new_takeWhile3(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3)))) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile3(yx36, yx47, yx61) → new_takeWhile12(yx36, yx47, yx61, yx36)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
In the following pairs the term without variables Pos(Succ(Zero)) is replaced by the fresh variable x_removed.
Pair: new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero))) → new_takeWhile13(Pos(Succ(Zero)), z1, z2)
Positions in right side of the pair:

The new variable was added to all pairs as a new argument[13].

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                      ↳ QDP

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(Pos(Succ(Zero)), z0, z1, x_removed) → new_takeWhile3(z1, z0, new_primPlusInt(z0, z1), x_removed)
new_takeWhile3(yx36, yx47, yx61, x_removed) → new_takeWhile12(yx36, yx47, yx61, yx36, x_removed)
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3))), x_removed) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2), x_removed)
new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero)), x_removed) → new_takeWhile13(x_removed, z1, z2, x_removed)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

The new variable was added to all pairs as a new argument[13].

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                      ↳ QDP

                                    ↳ ForwardInstantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(Pos(Succ(Zero)), z0, z1, x_removed) → new_takeWhile3(z1, z0, new_primPlusInt(z0, z1), x_removed)
new_takeWhile3(yx36, yx47, yx61, x_removed) → new_takeWhile12(yx36, yx47, yx61, yx36, x_removed)
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3))), x_removed) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2), x_removed)
new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero)), x_removed) → new_takeWhile13(x_removed, z1, z2, x_removed)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_takeWhile3(yx36, yx47, yx61) → new_takeWhile12(yx36, yx47, yx61, yx36) we obtained the following new rules:

new_takeWhile3(Pos(Succ(Zero)), x1, x2) → new_takeWhile12(Pos(Succ(Zero)), x1, x2, Pos(Succ(Zero)))
new_takeWhile3(Pos(Succ(Succ(y_0))), x1, x2) → new_takeWhile12(Pos(Succ(Succ(y_0))), x1, x2, Pos(Succ(Succ(y_0))))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                                      ↳ QDP

                                        ↳ RemovalProof

                                        ↳ RemovalProof

                                        ↳ MNOCProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero))) → new_takeWhile13(Pos(Succ(Zero)), z1, z2)
new_takeWhile3(Pos(Succ(Zero)), x1, x2) → new_takeWhile12(Pos(Succ(Zero)), x1, x2, Pos(Succ(Zero)))
new_takeWhile3(Pos(Succ(Succ(y_0))), x1, x2) → new_takeWhile12(Pos(Succ(Succ(y_0))), x1, x2, Pos(Succ(Succ(y_0))))
new_takeWhile13(Pos(Succ(Zero)), z0, z1) → new_takeWhile3(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3)))) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

Pair: new_takeWhile3(Pos(Succ(Zero)), x1, x2) → new_takeWhile12(Pos(Succ(Zero)), x1, x2, Pos(Succ(Zero)))
Positions in right side of the pair:

The new variable was added to all pairs as a new argument[13].

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                                      ↳ QDP

                                        ↳ RemovalProof

                                          ↳ QDP

                                        ↳ RemovalProof

                                        ↳ MNOCProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(Pos(Succ(Zero)), z0, z1, x_removed) → new_takeWhile3(z1, z0, new_primPlusInt(z0, z1), x_removed)
new_takeWhile3(Pos(Succ(Succ(y_0))), x1, x2, x_removed) → new_takeWhile12(Pos(Succ(Succ(y_0))), x1, x2, Pos(Succ(Succ(y_0))), x_removed)
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3))), x_removed) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2), x_removed)
new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero)), x_removed) → new_takeWhile13(x_removed, z1, z2, x_removed)
new_takeWhile3(Pos(Succ(Zero)), x1, x2, x_removed) → new_takeWhile12(x_removed, x1, x2, x_removed, x_removed)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

Pair: new_takeWhile3(Pos(Succ(Zero)), x1, x2) → new_takeWhile12(Pos(Succ(Zero)), x1, x2, Pos(Succ(Zero)))
Positions in right side of the pair:

The new variable was added to all pairs as a new argument[13].

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                                      ↳ QDP

                                        ↳ RemovalProof

                                        ↳ RemovalProof

                                          ↳ QDP

                                        ↳ MNOCProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile13(Pos(Succ(Zero)), z0, z1, x_removed) → new_takeWhile3(z1, z0, new_primPlusInt(z0, z1), x_removed)
new_takeWhile3(Pos(Succ(Succ(y_0))), x1, x2, x_removed) → new_takeWhile12(Pos(Succ(Succ(y_0))), x1, x2, Pos(Succ(Succ(y_0))), x_removed)
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3))), x_removed) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2), x_removed)
new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero)), x_removed) → new_takeWhile13(x_removed, z1, z2, x_removed)
new_takeWhile3(Pos(Succ(Zero)), x1, x2, x_removed) → new_takeWhile12(x_removed, x1, x2, x_removed, x_removed)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ RemovalProof

                                    ↳ RemovalProof

                                    ↳ ForwardInstantiation

                                      ↳ QDP

                                        ↳ RemovalProof

                                        ↳ RemovalProof

                                        ↳ MNOCProof

                                          ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile12(Pos(Succ(Zero)), z1, z2, Pos(Succ(Zero))) → new_takeWhile13(Pos(Succ(Zero)), z1, z2)
new_takeWhile3(Pos(Succ(Zero)), x1, x2) → new_takeWhile12(Pos(Succ(Zero)), x1, x2, Pos(Succ(Zero)))
new_takeWhile3(Pos(Succ(Succ(y_0))), x1, x2) → new_takeWhile12(Pos(Succ(Succ(y_0))), x1, x2, Pos(Succ(Succ(y_0))))
new_takeWhile13(Pos(Succ(Zero)), z0, z1) → new_takeWhile3(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile12(Pos(Succ(Succ(x3))), z1, z2, Pos(Succ(Succ(x3)))) → new_takeWhile3(z2, z1, new_primPlusInt(z1, z2))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

Q is empty.
We have to consider all (P,Q,R)-chains.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Pos(Succ(yx2800)), yx58, yx60) → new_takeWhile14(Pos(Succ(yx2800)), yx58, yx60, yx2800)
new_takeWhile4(Pos(Zero), yx58, yx60) → new_takeWhile15(Pos(Zero), yx58, yx60)
new_takeWhile14(yx27, yx57, yx28, yx3000) → new_takeWhile16(yx27, yx57, yx28)
new_takeWhile16(yx27, yx58, yx28) → new_takeWhile4(yx28, yx58, new_primPlusInt(yx58, yx28))
new_takeWhile4(Neg(Zero), yx58, yx60) → new_takeWhile15(Neg(Zero), yx58, yx60)
new_takeWhile15(yx27, yx58, yx28) → new_takeWhile4(yx28, yx58, new_primPlusInt(yx58, yx28))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile14(yx27, yx57, yx28, yx3000) → new_takeWhile16(yx27, yx57, yx28) we obtained the following new rules:

new_takeWhile14(Pos(Succ(z0)), z1, z2, z0) → new_takeWhile16(Pos(Succ(z0)), z1, z2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile4(Pos(Succ(yx2800)), yx58, yx60) → new_takeWhile14(Pos(Succ(yx2800)), yx58, yx60, yx2800)
new_takeWhile14(Pos(Succ(z0)), z1, z2, z0) → new_takeWhile16(Pos(Succ(z0)), z1, z2)
new_takeWhile4(Pos(Zero), yx58, yx60) → new_takeWhile15(Pos(Zero), yx58, yx60)
new_takeWhile16(yx27, yx58, yx28) → new_takeWhile4(yx28, yx58, new_primPlusInt(yx58, yx28))
new_takeWhile4(Neg(Zero), yx58, yx60) → new_takeWhile15(Neg(Zero), yx58, yx60)
new_takeWhile15(yx27, yx58, yx28) → new_takeWhile4(yx28, yx58, new_primPlusInt(yx58, yx28))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile15(yx27, yx58, yx28) → new_takeWhile4(yx28, yx58, new_primPlusInt(yx58, yx28)) we obtained the following new rules:

new_takeWhile15(Pos(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile15(Neg(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(Pos(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile4(Pos(Succ(yx2800)), yx58, yx60) → new_takeWhile14(Pos(Succ(yx2800)), yx58, yx60, yx2800)
new_takeWhile15(Neg(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile4(Pos(Zero), yx58, yx60) → new_takeWhile15(Pos(Zero), yx58, yx60)
new_takeWhile14(Pos(Succ(z0)), z1, z2, z0) → new_takeWhile16(Pos(Succ(z0)), z1, z2)
new_takeWhile16(yx27, yx58, yx28) → new_takeWhile4(yx28, yx58, new_primPlusInt(yx58, yx28))
new_takeWhile4(Neg(Zero), yx58, yx60) → new_takeWhile15(Neg(Zero), yx58, yx60)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_takeWhile16(yx27, yx58, yx28) → new_takeWhile4(yx28, yx58, new_primPlusInt(yx58, yx28)) we obtained the following new rules:

new_takeWhile16(Pos(Succ(z0)), z1, z2) → new_takeWhile4(z2, z1, new_primPlusInt(z1, z2))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ MNOCProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(Pos(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile4(Pos(Succ(yx2800)), yx58, yx60) → new_takeWhile14(Pos(Succ(yx2800)), yx58, yx60, yx2800)
new_takeWhile14(Pos(Succ(z0)), z1, z2, z0) → new_takeWhile16(Pos(Succ(z0)), z1, z2)
new_takeWhile4(Pos(Zero), yx58, yx60) → new_takeWhile15(Pos(Zero), yx58, yx60)
new_takeWhile15(Neg(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile16(Pos(Succ(z0)), z1, z2) → new_takeWhile4(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile4(Neg(Zero), yx58, yx60) → new_takeWhile15(Neg(Zero), yx58, yx60)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Instantiation

                                  ↳ QDP

                                    ↳ MNOCProof

                                      ↳ QDP

                                        ↳ NonTerminationProof

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile15(Pos(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile4(Pos(Succ(yx2800)), yx58, yx60) → new_takeWhile14(Pos(Succ(yx2800)), yx58, yx60, yx2800)
new_takeWhile15(Neg(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile4(Pos(Zero), yx58, yx60) → new_takeWhile15(Pos(Zero), yx58, yx60)
new_takeWhile14(Pos(Succ(z0)), z1, z2, z0) → new_takeWhile16(Pos(Succ(z0)), z1, z2)
new_takeWhile16(Pos(Succ(z0)), z1, z2) → new_takeWhile4(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile4(Neg(Zero), yx58, yx60) → new_takeWhile15(Neg(Zero), yx58, yx60)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

The TRS P consists of the following rules:

new_takeWhile15(Pos(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile4(Pos(Succ(yx2800)), yx58, yx60) → new_takeWhile14(Pos(Succ(yx2800)), yx58, yx60, yx2800)
new_takeWhile15(Neg(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))
new_takeWhile4(Pos(Zero), yx58, yx60) → new_takeWhile15(Pos(Zero), yx58, yx60)
new_takeWhile14(Pos(Succ(z0)), z1, z2, z0) → new_takeWhile16(Pos(Succ(z0)), z1, z2)
new_takeWhile16(Pos(Succ(z0)), z1, z2) → new_takeWhile4(z2, z1, new_primPlusInt(z1, z2))
new_takeWhile4(Neg(Zero), yx58, yx60) → new_takeWhile15(Neg(Zero), yx58, yx60)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

s = new_takeWhile4(Pos(Zero), yx58, new_primPlusInt(Neg(Zero), Pos(Zero))) evaluates to t =new_takeWhile4(Pos(Zero), yx58, new_primPlusInt(yx58, Pos(Zero)))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [yx58 / Neg(Zero)]
Matcher: [ ]

Rewriting sequence

new_takeWhile4(Pos(Zero), Neg(Zero), new_primPlusInt(Neg(Zero), Pos(Zero))) → new_takeWhile4(Pos(Zero), Neg(Zero), new_primMinusNat0(Zero, Zero))
with rule new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260) at position [2] and matcher [yx230 / Zero, yx260 / Zero]

new_takeWhile4(Pos(Zero), Neg(Zero), new_primMinusNat0(Zero, Zero)) → new_takeWhile4(Pos(Zero), Neg(Zero), Pos(Zero))
with rule new_primMinusNat0(Zero, Zero) → Pos(Zero) at position [2] and matcher [ ]

new_takeWhile4(Pos(Zero), Neg(Zero), Pos(Zero)) → new_takeWhile15(Pos(Zero), Neg(Zero), Pos(Zero))
with rule new_takeWhile4(Pos(Zero), yx58, yx60) → new_takeWhile15(Pos(Zero), yx58, yx60) at position [] and matcher [yx60 / Pos(Zero), yx58 / Neg(Zero)]

new_takeWhile15(Pos(Zero), Neg(Zero), Pos(Zero)) → new_takeWhile4(Pos(Zero), Neg(Zero), new_primPlusInt(Neg(Zero), Pos(Zero)))
with rule new_takeWhile15(Pos(Zero), z0, z1) → new_takeWhile4(z1, z0, new_primPlusInt(z0, z1))

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate4(yx17) → new_iterate4(new_ps4(yx17))

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Neg(yx260), Neg(yx230)) → Neg(new_primPlusNat0(yx260, yx230))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_ps4(yx17) → new_primPlusInt(Pos(Zero), yx17)
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))
new_primPlusInt(Neg(yx260), Pos(yx230)) → new_primMinusNat0(yx230, yx260)
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps4(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate4(yx17) → new_iterate4(new_ps4(yx17))

The TRS R consists of the following rules:

new_ps4(yx17) → new_primPlusInt(Pos(Zero), yx17)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps4(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_primMinusNat0(Succ(yx2600), Zero) → Pos(Succ(yx2600))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = 1 + 2·x₁
POL(Pos(x₁)) = 2·x₁
POL(Succ(x₁)) = x₁
POL(Zero) = 0
POL(new_iterate4(x₁)) = 2·x₁
POL(new_primMinusNat0(x₁, x₂)) = 1 + 2·x₁ + 2·x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = 2·x₁ + x₂
POL(new_ps4(x₁)) = x₁

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate4(yx17) → new_iterate4(new_ps4(yx17))

The TRS R consists of the following rules:

new_ps4(yx17) → new_primPlusInt(Pos(Zero), yx17)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps4(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primMinusNat0(Succ(yx2600), Succ(yx2300)) → new_primMinusNat0(yx2600, yx2300)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = x₁
POL(Pos(x₁)) = 2·x₁
POL(Succ(x₁)) = 2 + x₁
POL(Zero) = 0
POL(new_iterate4(x₁)) = 2·x₁
POL(new_primMinusNat0(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = x₁ + x₂
POL(new_ps4(x₁)) = x₁

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ RuleRemovalProof

                                  ↳ QDP

                                    ↳ RuleRemovalProof

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate4(yx17) → new_iterate4(new_ps4(yx17))

The TRS R consists of the following rules:

new_ps4(yx17) → new_primPlusInt(Pos(Zero), yx17)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)
new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps4(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_primPlusNat0(Succ(yx2600), Zero) → Succ(yx2600)
new_primPlusNat0(Succ(yx2600), Succ(yx2300)) → Succ(Succ(new_primPlusNat0(yx2600, yx2300)))

Used ordering: POLO with Polynomial interpretation [25]:

POL(Neg(x₁)) = x₁
POL(Pos(x₁)) = x₁
POL(Succ(x₁)) = 2 + x₁
POL(Zero) = 0
POL(new_iterate4(x₁)) = x₁
POL(new_primMinusNat0(x₁, x₂)) = x₁ + x₂
POL(new_primPlusInt(x₁, x₂)) = 2·x₁ + x₂
POL(new_primPlusNat0(x₁, x₂)) = 2·x₁ + x₂
POL(new_ps4(x₁)) = x₁

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ RuleRemovalProof

                                  ↳ QDP

                                    ↳ RuleRemovalProof

                                      ↳ QDP

                                        ↳ Rewriting

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate4(yx17) → new_iterate4(new_ps4(yx17))

The TRS R consists of the following rules:

new_ps4(yx17) → new_primPlusInt(Pos(Zero), yx17)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps4(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_iterate4(yx17) → new_iterate4(new_ps4(yx17)) at position [0] we obtained the following new rules:

new_iterate4(yx17) → new_iterate4(new_primPlusInt(Pos(Zero), yx17))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ RuleRemovalProof

                                  ↳ QDP

                                    ↳ RuleRemovalProof

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ UsableRulesProof

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate4(yx17) → new_iterate4(new_primPlusInt(Pos(Zero), yx17))

The TRS R consists of the following rules:

new_ps4(yx17) → new_primPlusInt(Pos(Zero), yx17)
new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps4(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ RuleRemovalProof

                                  ↳ QDP

                                    ↳ RuleRemovalProof

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ UsableRulesProof

                                              ↳ QDP

                                                ↳ QReductionProof

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate4(yx17) → new_iterate4(new_primPlusInt(Pos(Zero), yx17))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_ps4(x0)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_ps4(x0)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ RuleRemovalProof

                              ↳ QDP

                                ↳ RuleRemovalProof

                                  ↳ QDP

                                    ↳ RuleRemovalProof

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ UsableRulesProof

                                              ↳ QDP

                                                ↳ QReductionProof

                                                  ↳ QDP

                                                    ↳ NonTerminationProof

                      ↳ QDP

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_iterate4(yx17) → new_iterate4(new_primPlusInt(Pos(Zero), yx17))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

The set Q consists of the following terms:

new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_primPlusInt(Pos(x0), Pos(x1))
new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusInt(Neg(x0), Neg(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Succ(x0))
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Zero)
new_primPlusNat0(Succ(x0), Succ(x1))

new_iterate4(yx17) → new_iterate4(new_primPlusInt(Pos(Zero), yx17))

The TRS R consists of the following rules:

new_primPlusInt(Pos(yx260), Pos(yx230)) → Pos(new_primPlusNat0(yx260, yx230))
new_primPlusInt(Pos(yx260), Neg(yx230)) → new_primMinusNat0(yx260, yx230)
new_primMinusNat0(Zero, Succ(yx2300)) → Neg(Succ(yx2300))
new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(yx2300)) → Succ(yx2300)

s = new_iterate4(yx17) evaluates to t =new_iterate4(new_primPlusInt(Pos(Zero), yx17))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [yx17 / new_primPlusInt(Pos(Zero), yx17)]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_iterate4(yx17) to new_iterate4(new_primPlusInt(Pos(Zero), yx17)).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPSizeChangeProof

                      ↳ QDP

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_takeWhile17(yx21, :(yx180, yx181)) → new_takeWhile18(yx180, yx181, yx180)
new_takeWhile18(yx21, yx18, Neg(Zero)) → new_takeWhile17(yx21, yx18)
new_takeWhile19(yx21, :(yx180, yx181)) → new_takeWhile18(yx180, yx181, yx180)
new_takeWhile18(yx21, :(yx180, yx181), Pos(Zero)) → new_takeWhile18(yx180, yx181, yx180)
new_takeWhile18(yx21, yx18, Neg(Succ(yx2200))) → new_takeWhile19(yx21, yx18)

From the DPs we obtained the following set of size-change graphs:

new_takeWhile18(yx21, yx18, Neg(Zero)) → new_takeWhile17(yx21, yx18)
The graph contains the following edges 1 >= 1, 2 >= 2
new_takeWhile18(yx21, :(yx180, yx181), Pos(Zero)) → new_takeWhile18(yx180, yx181, yx180)
The graph contains the following edges 2 > 1, 2 > 2, 2 > 3
new_takeWhile18(yx21, yx18, Neg(Succ(yx2200))) → new_takeWhile19(yx21, yx18)
The graph contains the following edges 1 >= 1, 2 >= 2
new_takeWhile17(yx21, :(yx180, yx181)) → new_takeWhile18(yx180, yx181, yx180)
The graph contains the following edges 2 > 1, 2 > 2, 2 > 3
new_takeWhile19(yx21, :(yx180, yx181)) → new_takeWhile18(yx180, yx181, yx180)
The graph contains the following edges 2 > 1, 2 > 2, 2 > 3

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ NumRed

                ↳ HASKELL

                  ↳ Narrow

                    ↳ AND

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                      ↳ QDP

                        ↳ QDPSizeChangeProof

                  ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map(:(yx130, yx131), ba) → new_map(yx131, ba)

From the DPs we obtained the following set of size-change graphs:

new_map(:(yx130, yx131), ba) → new_map(yx131, ba)
The graph contains the following edges 1 > 1, 2 >= 2

Haskell To QDPs

takeWhile	p []	= takeWhile3 p []
takeWhile	p (x : xs)	= takeWhile2 p (x : xs)

takeWhile1	p x xs True	= x : takeWhile p xs
takeWhile1	p x xs False	= takeWhile0 p x xs otherwise

toEnum	xw	= toEnum5 xw
toEnum	wy	= toEnum3 wy
toEnum	wx	= toEnum1 wx

numericEnumFromThenToP1	yu yv yw True	= flip (<=) yw
numericEnumFromThenToP1	yu yv yw False	= numericEnumFromThenToP0 yu yv yw otherwise